Question: Consider the CFG shown below: A > N @ id. N N->id N' N'--> . id N' where A, N, N' are non-terminals and
Consider the CFG shown below: A > N @ id. N N->id N' N'--> . id N' where A, N, N' are non-terminals and id,.,@ are terminals(without comma) and & is the empty string. A is the starting symbol. 1- Compute the FIRST and FOLLOW sets of the grammar above. 2- Create the LL(1) parsing table. is this LL(1) grammar? Explain. 3- Parse the following string id@id.ids. Show the stack and the string at each step.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
