Context-Free Grammars G1 & G2: Language Generation (GATE CS 2016 Q6)

Computer Sciences > Gate 2016 Set-1 > CGF

Consider the following context-free grammars:

G1: S → aS|B, B → b|bB
G2: S → aA|bB, A → aA|B|ε, B → bB|ε

Which one of the following pairs of languages is generated by G1 and G2, respectively?

{a^mbⁿ |m > 0 or n > 0} and {a^mbⁿ |m > 0 and n > 0}

{a^mbⁿ |m > 0 and n > 0} and {a^mbⁿ |m > 0 or n ≥ 0}

{a^mbⁿ |m ≥ 0 or n > 0} and {a^mbⁿ |m > 0 and n > 0}

{a^mbⁿ |m ≥ 0 and n > 0} and {a ^mbⁿ |m > 0 or n > 0}

Correct : CGF

Similar Questions