Compiler-1M-Consider the grammar shown below

Consider the grammar shown below
S → A
A → aBA'
A' → dA' | ε
B →bBC | f
C → g
In the LL(1) parsing table M of this grammar, the entries M[S, a] M[A', $] respectively are

(A) {S → A} and {A' → ε}
(B) {S → A} and {A' → dA'}
(C) {S → A} and {}
(D) {} and {A' → ε}

A

B

C

D

0Comment