Consider the following context-free grammars:
G₁ : S → aS|B, B → b|bB
G₂ : S → aA|bB, A → aA|B|ϵ, B → bB|ϵ
Which one of the following pairs of languages is generated by G₁ and G₂, respectively?

Question

Examsnet · Accepted Answer

Correct Answer is : {ambn|m ≥ 0 and n > 0} and {ambn|m > 0 or n > 0}

GATE Computer Science (CS) 2016 Shift 1 Solved Paper