Exercise 1.

Consider the following grammar G (with terminals a, b and nonterminals S, A)

S	$\longmapsto$	AS  |  b
A	$\longmapsto$	SA  |  a

Let L be the language generated by G. Consider the words w₁ = baab, w₂ = abab, w₃ = bbaa. For i = 1, 2, 3, if w_i belongs to L then give a parse tree for w_i with G.

Answer 1