GATE 2024 · CS1 - Forenoon
Consider the following grammar G, with S as the start symbol. The grammar G has three incomplete productions denoted by (1), (2), and (3).
S → daT | (1)
T → aS | bT | (2)
R → (3) | ε
The set of terminals is {a,b,c,d,f}. The FIRST and FOLLOW sets of the different non-terminals are as follows.
FIRST(S) = {c,d,f}, FIRST(T) = {a,b,ε}, FIRST(R) = {c,ε}
FOLLOW(S) = FOLLOW(T) = {c,f,$}, FOLLOW(R) = {f}
Which one of the following options CORRECTLY fills in the incomplete productions?