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

  1. A.

    S → aSc | S1
    S1 → bS1c | λ

  2. B.

    S → aSc | S1 | λ
    S1 → bS1c

  3. C.

    S → aSc | S1 | λ
    S1 → bS1c | λ

  4. D.

    S → aSc | λ
    S1 → bS1c | λ

  5. 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 free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…