The Greibach normal form grammar for the language L = {an bn + 1 | n ≥ 0} is
A. S → a SB, B → bB | λ
B. S → a SB, B → bB | b
C. S → a SB | b, B → b
D. S → a Sb | b
Answer:C
The Greibach normal form grammar for the language L = {an bn + 1 | n ≥ 0} is
A. S → a SB, B → bB | λ B. S → a SB, B → bB | b C. S → a SB | b, B → b D. S → a Sb | b