Consider the following grammar:
S - FR
F - i
R - +S | epsilon

In the predictive parser table M of the grammar, the e...

Question

Consider the following grammar:
S -> FR
F -> i
R -> +S | epsilon

In the predictive parser table M of the grammar, the entries M[S, id] and M[R, +] respectively are

A. {S -> FR} and {R -> +S}
B. {S -> FR} and {R -> epsilon}
C. {S -> FR} and {R -> +S}
D. {R -> id} and {R -> +i}

Accepted Answer

M[S, id] = {S -> FR} and M[R, +] = {R -> +S}, which is option A. We have a simple expression grammar where S expands to FR, F is an identifier (i/id), and R handles the optional '+S' part. We must fill in the LL(1) predictive parse table by computing FIRST and FOLLOW sets and placing each production in the correct table cell.

Consider the following grammar: S -> FR F -> i R -> +S | epsilon In the predictive parser table M of the grammar, the entries M[S, id] and M[R, +] respectively are A. {S -> FR} and {R -> +S} B. {S -> FR} and {R -> epsilon} C. {S -> FR} and {R -> +S} D. {R -> id} and {R -> +i}