Question: (a) state the pumping lemma for the regular language. Prove that the grammar G given below is ambiguous by giving two different parse trees of
(a) state the pumping lemma for the regular language.
Prove that the grammar G given below is ambiguous by giving two different parse trees of the string iiaea. Both of those parse trees are correct, but only one of them is consistent with the usual rule for resolving ambiguity of if-then-else statements. Which one? 1. Sa 2. S iS 3. S iSeS
Step by Step Solution
3.43 Rating (153 Votes )
There are 3 Steps involved in it
The answer provided below has been developed in a clear step by step manne... View full answer
Get step-by-step solutions from verified subject matter experts
