Explore topic-wise MCQs in Compilers.

This section includes 5 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 Push Down Automata is if there is at most one transition applicable to each configuration

A. Deterministic
B. Non deterministic
C. Finite
D. Non finite
Answer» B. Non deterministic
Discussion
2.

A language is regular if and only if it is accepted by finite automata

A. The given statement statement is true
B. Given statement is false
C. Statement is partially true
D. None of the mentioned
Answer» B. Given statement is false
Discussion
3.

Grammars that can be translated to DFAs

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

Which of the following identity is wrong?

A. R + R = R
B. (R*)* = R*
C. …õR = R…õ = R
D. √òR = R√ò = RR*
Answer» E.
Discussion
5.

A context free language is called ambiguous if

A. It has 2 or more than 2 left derivations for some terminal string —° —î L (G)
B. It has 2 or more than 2 left derivations for some terminal string —° —î L (G)
C. Both of the mentioned
D. None of the mentioned
Answer» D. None of the mentioned
Discussion