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.

THE_REGULAR_EXPRESSION_DENOTE_A_LANGUAGE_COMPRISING_ALL_POSSIBLE_STRINGS_OF_EVEN_LENGTH_OVER_THE_ALPHABET_(0,1)?$

A. 1 + 0(1+0)*
B. (0+1)(1+0)*
C. (1+0)
D. (00+0111+10)*
Answer» E.
Discussion
2.

The_regular_expressions_denote_zero_or_more_instances_of_an_x_or_y_is$

A. (x+y)
B. (x+y)*
C. (x* + y)
D. (xy)*
Answer» C. (x* + y)
Discussion
3.

Which of the following String can be obtained by the language L = {ai b2i / i >=1}

A. aaabbbbbb
B. aabbb
C. abbabbba
D. aaaabbbabb
Answer» B. aabbb
Discussion
4.

Let R1 and R2 be regular sets defined over alphabet ‚àë then$

A. R1 UNION R2 is regular
B. R1 INTERSECTION R2 is regular
C. ‚àë INTERSECTION R2 IS NOT REGULAR
D. R2* IS NOT REGULAR
Answer» B. R1 INTERSECTION R2 is regular
Discussion
5.

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
6.

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