Home / Engineering / Theory of Computation / Question


Mr. Dubey • 51.17K Points

Q.) Consider the following statements about the context free grammar G = {S - >SS,S - >ab,S ->ba, S - ε}
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III. G can be accepted by a deterministic PDA.
Which combination below expresses all the true statements about G?

(A) 1 only
(B) 1 and 3
(C) 2 and 3
(D) 1,2 and 3
Correct answer : Option (D) - 1,2 and 3



Login to discuss.