Consider the following context-free grammar where the start symbol is S and the set of terminals is a,b,c,d . S → AaAb | BbBa A → cS | ε B → dS | ε The fol

Question

Consider the following context-free grammar where the start symbol is S and the set of terminals is {a,b,c,d}.
S → AaAb | BbBa
A → cS | ε
B → dS | ε
The following is a partially-filled LL(1) parsing table.
Row S: col a: S→AaAb, col b: S→BbBa, col c: (1), col d: (2)
Row A: col a: A→ε, col b: (3), col c: A→cS
Row B: col a: (4), col b: B→ε, col d: B→dS
Which one of the following options represents the CORRECT combination for the numbered cells in the parsing table?
Note: In the options, "blank" denotes that the corresponding cell is empty.

Accepted Answer

A. (1) S→AaAb (2) S→BbBa (3) A→ε (4) B→ε

Related Compiler Design PYQs

Turn practice into measurable progress