Assignment #3
Due TBA.
2.4 b, c, e, f
2.5
2.6 b, d
2.9
2.31
Find regular expressions for the languages generated by the following
1) S --> SSS|a|b
2) S --> AabB
A --> aA|ba|ε
B --> Bab|Bb|ab|b
3) S --> AAS|ab|aab
A --> ab|ba|ε
Show that the following context free grammars are ambiguous and find an equivalent unambiguous grammar.
4) S --> SS|a|b
5) S --> ABA
A --> aA|ε
B --> bB|ε
EXTRA CREDIT:
2.30a
2.34