The grammar
1. S ->AB
2. A ->Aa
3. S -> B
4. A -> epsilon
5. B -> bB
6. B -> epsilon
If an LL(1) parsing table is constructed for above grammar where T(X, c) represents
production used to expand variable X on look ahead ‘a’, which of the following is true.
(i) T(A, b) = 4 (ii) T(a, $) = 3, 4
(iii) T(A, $) = 4 (iv) T(B, $) = 6, 1
(A) (i) & (iv) are correct
(B) (i) alone is correct
(C) (i) & (iii) are correct
(D) (i), (ii) & (iv) are correct
