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.

Give a production grammar that specified language L = {ai b2i >= 1}:

A. {S->aSbb,S->abb}
B. {S->aSb, S->b}
C. {S->aA,S->b,A->b}
D. None of the mentioned
Answer» B. {S->aSb, S->b}
Discussion
2.

Consider the production of the grammar S->AA A->aa A->bb.Describe the language specified by the production grammar.

A. L = {aaaa,aabb,bbaa,bbbb}
B. L = {abab,abaa,aaab,baaa}
C. L = {aaab,baba,bbaa,bbbb}
D. L = {aaaa,abab,bbaa,aaab}
Answer» B. L = {abab,abaa,aaab,baaa}
Discussion
3.

Regular expressions are closed under

A. Union
B. Intersection
C. Kleen star
D. All of the mentioned
Answer» E.
Discussion
4.

L and ~L are recursive enumerable then L is

A. Regular
B. Context free
C. Context sensitive
D. Recursive
Answer» E.
Discussion
5.

Regular expression are

A. Type 0 language
B. Type 1 language
C. Type 2 language
D. Type 3 language
Answer» B. Type 1 language
Discussion
6.

Which of the following is not a regular expression?

A. [(a+b)*-(aa+bb)]*
B. [(0+1)-(0b+a1)*(a+b)]*
C. (01+11+10)*
D. (1+2+0)*(1+2)*
Answer» C. (01+11+10)*
Discussion