LL grammar for the language L = {an bm cn+m | m≥0, n≥0} is
A. S → aSc | S1 ; S1 → bS1c | λ
B. S → aSc | S1| λ ; S1 → bS1c
C. S → aSc | S1| λ ; S1 → bS1c| λ
D. S → aSc | λ ; S1 → bS1c| λ
Answer:C
LL grammar for the language L = {an bm cn+m | m≥0, n≥0} is
A. S → aSc | S1 ; S1 → bS1c | λ B. S → aSc | S1| λ ; S1 → bS1c C. S → aSc | S1| λ ; S1 → bS1c| λ D. S → aSc | λ ; S1 → bS1c| λ