Consider the following grammar , with as the start symbol. The grammar has three incomplete productions denoted by (1), (2), and (3).
(1)
(2)
(3)
The set of terminals is . The FIRST and FOLLOW sets of the different non-terminals are as follows.
FIRST() = , FIRST() = , FIRST() =
FOLLOW() = FOLLOW() = , FOLLOW() =
Which one of the following options CORRECTLY fills in the incomplete productions?
- A(1) , (2) , (3)
- B(1) , (2) , (3)
- C(1) , (2) , (3)
- D(1) , (2) , (3)

