Explore topic-wise MCQs in Compilers.

This section includes 8 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_LANGUAGE_ACCEPTED_BY_A_PUSH_DOWN_AUTOMATA?$

A. Type0
B. Type1
C. Type2
D. Type3
Answer» D. Type3
Discussion
2.

Given_the_following_statements_:_(i)_Recursive_enumerable_sets_are_closed_under_complementation._(ii)_Recursive_sets_are_closed_under_complements._Which_is/are_the_correct_statements_?$

A. I only
B. II only
C. Both I and II
D. Neither I nor II
Answer» C. Both I and II
Discussion
3.

Grammars that can be translated to DFA?

A. Left linear grammar
B. Right linear grammar
C. Generic grammar
D. All of the mentioned
Answer» C. Generic grammar
Discussion
4.

Recursively enumerable languages are not closed under

A. Union
B. Intersection
C. Complementation
D. Concatenation
Answer» D. Concatenation
Discussion
5.

Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^) , (-,-) , (+,+) , (*,*) in the operator precedence table constructed for the grammar

A. All <
B. All >
C. < > , =
D. < > > >
Answer» E.
Discussion
6.

Which of the following conversion is not possible (algorithmically)?

A. Regular grammar to CFG
B. NDFA to DFA
C. NDPDA to DPDA
D. NDTM to DTM
Answer» D. NDTM to DTM
Discussion
7.

If P & R are regular and also given that if PQ=R, then

A. Q has to be regular
B. Q cannot be regular
C. Q need not be regular
D. Q has to be a CFL
Answer» D. Q has to be a CFL
Discussion
8.

Assume the statements S1 and S2 given as :

A. is infinite.
B.
Answer» B.
Discussion