Question
Compute FIRST and FOLLOW for all non-terminals in the grammar:
S → ACB | CbB | Ba
A → da | BC
B → g | ε
C → h | ε
Construct the LL(1) parsing table. Is this grammar LL(1)? Justify your answer.
This answer is restricted. Please login to view the answer of this question.
Login Now
Subscribe
Login
Please login to comment
0 Comments
Oldest