LL grammar for the language L = {an bm cn+m | m≥0, n≥0} is
PYQ UGC NET 2013Modified — slightly modified from the official paper; see the solution
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| λ
Attempted by 139 students.
Sign up free to check your answer
Sign up freeLoading lesson…

