Home / Engineering / Theory of Computation / Question
M
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?
Related MCQs on Theory of Computation
Q. Which among the following is the duties of the Data Nodes
Q. A register organized to allow to move left or right operations is called a ____
Q. Which of the following displays the exit status of the last executed command?
Q. The valid – invalid bit, in this case, when valid indicates?
Q. The addressing mode/s, which uses the PC instead of a general purpose register is
Q. Risk management is one of the most important jobs for a
Discusssion
Login to discuss.