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

  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| λ

Attempted by 139 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…