Consider the following Grammer:
S -> (L) | a; L -> L, S | S
Note that the parenthese and comma are actually terminals in this language and appear in the sentences accepted by this grammer. Try to describe the language generated by this grammer. Is this grammer ambiguous?
Comments
Leave a comment