GATE 2003
February 13, 2024GATE 2003
February 13, 2024Parsers
| Question 12 |
Consider the grammar shown below
S → i E t S S' | a S' → e S | ε E → b
In the predictive parse table. M, of this grammar, the entries M[S’, e] and M[S’, $] respectively are
| {S’→e S} and {S’→ε} | |
| {S’→e S} and { } | |
| {S’→ε} and {S’→ε} | |
| {S’→e S, S’→ε} and {S’→ε} |
Question 12 Explanation:
First(S) = {1,a}
First(S’) = {e,ε}
First(E) = {b}
Follow(S’) = {e,$}
Only when ‘First’ contains ε, we need to consider FOLLOW for getting the parse table entry.
Hence, option (D) is correct.
First(S’) = {e,ε}
First(E) = {b}
Follow(S’) = {e,$}
Only when ‘First’ contains ε, we need to consider FOLLOW for getting the parse table entry.
Hence, option (D) is correct.
Correct Answer: D
Question 12 Explanation:
First(S) = {1,a}
First(S’) = {e,ε}
First(E) = {b}
Follow(S’) = {e,$}
Only when ‘First’ contains ε, we need to consider FOLLOW for getting the parse table entry.
Hence, option (D) is correct.
First(S’) = {e,ε}
First(E) = {b}
Follow(S’) = {e,$}
Only when ‘First’ contains ε, we need to consider FOLLOW for getting the parse table entry.
Hence, option (D) is correct.