Consider the following grammar with terminal alphabet ∑ {a,(, ), +, *} and…
PYQ GATE 2001
Consider the following grammar with terminal alphabet ∑ {a,(, ), +, *} and start symbol E. The production rules of the grammar are:
E → aA
E → (E)
A → +E
A → *E
A → ε(a) Compute the FIRST and FOLLOW sets for E and A.
(b) Complete the LL(1) parse table for the grammar.
Sign up free to check your answer
Sign up freeLoading lesson…

