Next:
Is the language L regular?
Up:
Compiler Theory: Assignment 2: elements
Previous:
Exercise 3
Elements of Answers for Exercise 3
Subsections
Is the language
L
regular?
Show that the language
L
is context-free.
Show that
G
is ambiguous.
Next:
Is the language L regular?
Up:
Compiler Theory: Assignment 2: elements
Previous:
Exercise 3
Marc Moreno Maza
2004-12-01
