UGC-NET | UGC NET CS 2018 July – II | Question 36

Consider the following two Grammars :
G₁ : S → SbS|a
G₂ : S → aB|ab, A→GAB|a, B→ABb|b
Which of the following option is correct ?
(A) Only G₁ is ambiguous
(B) Only G₂ is ambiguous
(C) Both G₁ and G ₂are ambiguous
(D) Both G₁ and G₂are not ambiguous

Answer: (C)
Explanation: A grammar is said to be ambiguous if we can generate more than one parse for same given string.
Here both Grammar G1 and G2 are ambiguous as For G1 we can generate more than one parse tree for the same string “ababa”.
Since G1 is ambiguous and for G2 we can also generate more than one parse the for the string ” ab ” since G2 is also ambiguous.

Option (C) is correct.
Quiz of this Question