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

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

{a m b n |m > 0 or n > 0} and {a m b n |m > 0 and n > 0}

{a m b n |m > 0 and n > 0} and {a m b n |m > 0 or n ≥ 0}

{a m b n |m ≥ 0 or n > 0} and {a m b n |m > 0 and n > 0}

{a m b n |m ≥ 0 and n > 0} and {a m b n |m > 0 or n > 0}

GATE Computer Science (CS) 2016 Shift 1 Solved Paper

Question : 52 of 65

Marks: +1, -0

Go to Question:

Prev Question

Next Question