Next: Exercise 2.
Up: Quiz1
Previous: Guidelines.
Consider the following grammar G (with terminals a, b and nonterminals S, A)
S 

AS  b 
A 

SA  a 
Let L be the language generated by G.
Consider the words
w_{1} = baab,
w_{2} = abab,
w_{3} = bbaa.
For i = 1, 2, 3, if w_{i} belongs to L then give a parse
tree for w_{i} with G.
Answer 1
Next: Exercise 2.
Up: Quiz1
Previous: Guidelines.
Marc Moreno Maza
20041202