Explore topic-wise MCQs in Compilers.

This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.

1.

A CFG is closed under _________

A. Union
B. Kleene star
C. Concatenation
D. None of the mentioned
Answer» E.
Discussion
2.

A regular Grammar is a _________

A. CFG
B. Non CFG
C. English Grammar
D. None of the mentioned
Answer» B. Non CFG
Discussion
3.

Push down automata accepts which language?

A. Context sensitive language
B. Context free language
C. Recursive language
D. None of the mentioned
Answer» C. Recursive language
Discussion
4.

The context free grammar S SS | 0S1 | 1S0 | generates _________

A. Equal number of 0 s and 1 s
B. Unequal number of 0 s and 1 s
C. Number of 0 s followed by any number of 1 s
D. None of the mentioned
Answer» B. Unequal number of 0 s and 1 s
Discussion
5.

The context free grammar S A111|S1, A A0 | 00 is equivalent to _________

A. {0<sup>n</sup>1<sup>m</sup> | n=2, m=3}
B. {0<sup>n</sup>1<sup>m</sup> | n=1, m=5}
C. {0<sup>n</sup>1<sup>m</sup> | n should be greater than two and m should be greater than four}
D. None of the mentioned
Answer» B. {0<sup>n</sup>1<sup>m</sup> | n=1, m=5}
Discussion
6.

A context free language is called ambiguous if _________

A. It has 2 or more left derivations for some terminal string L (G)
B. It has 2 or more right derivations for some terminal string L (G)
C. It has 2 or more left &amp; right derivations for some terminal string L (G)
D. None of the mentioned
Answer» C. It has 2 or more left &amp; right derivations for some terminal string L (G)
Discussion