Consider the following grammar: In the predictive parser table, M, of – McqOptions

MCQOPTIONS

1.	Consider the following grammar: In the predictive parser table, M, of the grammar the entries M [S, id] and M [R, $] respectively.
A.	{S ” FR} and {R ” ε}
B.	{S ” FR} and {}
C.	{S ” FR} and {R ” * S}
D.	{F ” id} and {R ” ε}View Answer
Answer» B. {S ” FR} and {}

Discussion

No Comment Found

Related MCQs

Consider the grammar with non-terminals. The grammar is NOTLL(1) because ________
Which one of the following is a top-down parser?
In the correct grammar above, what is the length of the derivation (number of steps starting from S to generate the string a l b m with l ! m?
Consider the following grammar: In the predictive parser table, M, of the grammar the entries M [S, id] and M [R, $] respectively.
Assume the conflicts part (a) of this question are resolved and an LALR (1) parser is generated for parsing arithmetic expressions as per the given grammar. Consider an expression 3 # 2 + 1. What precedence and associativity properties does the generated parser realize?
The below grammar and the semantic rules are fed to a yacc tool (which is an LALR (1) parser generator) for parsing and evaluating arithmetic expressions. Which one of the following is true about the action of yacc for the given grammar?