Consider the grammar shown below: S → i E t S S’/

Home » Compiler Design » Compiler design miscellaneous » Question

Consider the grammar shown below:
S → i E t S S’/ a
S → e S I ε
E → b
In the predictive parser table, M of this grammar, the entire M[S’, e] and M [S’,$] respectively are

1. {S’→ e S} and {S’ → ε}
2. {S’ → e S} and {}
3. {S’ → ε} and {S’ → ε}
4. {S’ → e S, S’ → ε} and {S’ → ε}

Correct Option: D

NA