Consider the following grammar: S → F R R → * S | ε F → id In the predictive…
GATE · 2006 · CS
Consider the following grammar:
S → F R
R → * S | ε
F → id
In the predictive parser table M of this grammar, the entries M[S, id] and M[R, $] respectively are:
- A.
{S → FR} and {R → ε }
- B.
{S → FR} and { }
- C.
{S → FR} and {R → *S}
- D.
{F → id} and {R → ε}
Attempted by 126 students.
Sign up free to check your answer
Sign up freeLoading lesson…