Next: Exercise 3.
Up: Quiz10
Previous: Exercise 1.
We consider the alphabet
= {a, b}
and the grammar G below.
Let L be the language generated by G over .
G 



Give a grammar G' generating
L {} and
with no
productions, that is
no rules of the form
X ,
where
denotes the empty word.
Is G' leftrecursive?
Answer 2
Next: Exercise 3.
Up: Quiz10
Previous: Exercise 1.
Marc Moreno Maza
20041202