27. The context free grammar for the language
L={anbm|n≤m+3,n≥0.m≥0}is
(A) S→aaaA; A→aAb|B, B→Bb | λ,
(B) S → aaaA|λ, A -> aAb | B, B→ Bb|λ
(C) S→aaaA | aa A |λ , A -> aAb | B|λ, B→ Bb|λ
(D) S→aaaA | aa A | aA |λ , A → aAb | B, B→ Bb | λ
ANS-(D)
L={anbm|n≤m+3,n≥0.m≥0}is
(A) S→aaaA; A→aAb|B, B→Bb | λ,
(B) S → aaaA|λ, A -> aAb | B, B→ Bb|λ
(C) S→aaaA | aa A |λ , A -> aAb | B|λ, B→ Bb|λ
(D) S→aaaA | aa A | aA |λ , A → aAb | B, B→ Bb | λ
ANS-(D)
No comments:
Post a Comment