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 \rightarrow daT \mid \underline{\quad (1) \quad}$$ $$T \rightarrow aS \mid bT \mid \underline{\quad (2) \quad}$$ $$R \rightarrow \underline{\quad (3) \quad} \mid \epsilon$$ The set of terminals is $\{a, b, c, d, f\}$. The FIRST and FOLLOW sets of the different non-terminals are as follows. $$\text{FIRST}(S) = \{c, d, f\}, \text{ FIRST}(T) = \{a, b, \epsilon\}, \text{ FIRST}(R) = \{c, \epsilon\}$$ $$\text{FOLLOW}(S) = \text{FOLLOW}(T) = \{c, f, \$\}, \text{ FOLLOW}(R) = \{f\}$$ Which one of the following options CORRECTLY fills in the incomplete productions?

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?

Topic-wise GATE CS PYQs with verified steps