M
Q. Consider the following statements about the context free grammarG = {S - >SS, S - >ab, S - >ba, S - ε}I. G is ambiguousII. G produces all strings with equal number of a’s and b’sIII. G can be accepted by a deterministic PDA.Which combination below expresses all the true statements about G?
Be the first to start discuss.
Related MCQs
Q. The VLIW processors are much simpler as they do not require of
Q. Problem: Players will play if weather is sunny. Is t
Q. General theory of Administration is the expression of:
Q. Concerning the legibility of text:
Q. A static local variable is used to
Q. Canonical form is a unique way of representing
Q. What allows to implement application specific test automation solution by adding so,e extra code
Discusssion
Login to discuss.