Previous year questions of Compiler Construction ( CC )2014 which appear in b.tech (computer engineering ) Rajasthan technical university (RTU)
1. Explain the syntax Directed Translation Schemes in details.
2. Let G be a grammar with non-terminal Symbol S and D, terminal symbol 'b', '0', and '1', start symbol S, and the following production rule
S -> bD
D -> 0D
D -> 1D
D -> 0
D -> 1
a. Is G regular ? Why (not) ?
b. Turn G systematically into a finite automation ?
View All questions with answers
1. Explain the syntax Directed Translation Schemes in details.
2. Let G be a grammar with non-terminal Symbol S and D, terminal symbol 'b', '0', and '1', start symbol S, and the following production rule
S -> bD
D -> 0D
D -> 1D
D -> 0
D -> 1
a. Is G regular ? Why (not) ?
b. Turn G systematically into a finite automation ?
View All questions with answers
No comments:
Post a Comment