LL grammar for the language L = { an bm cn+m | m ≥ 0, n ≥ 0 } is
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 | λ - E.
Both of the following are correct LL grammars for L:
S → aSc | S1 ; S1 → bS1c | λ
AND
S → aSc | S1 | λ ; S1 → bS1c | λ
Attempted by 43 students.
Sign up free to check your answer
Sign up freeLoading lesson…

