Compiler Construction MCQs with Answers
Practice important Compiler Construction MCQs with answers and explanations.
Multiple Choice Questions
Q241: REs are a notation for ________.
- A: Context-free grammar
- B: Finite automata
- C: Regular languages
- D: Pushdown automata
View Answer
C
Q242: In NFA to DFA conversion, which of the following is true?
- A: DFA always has fewer states than NFA
- B: NFA and DFA are the same
- C: DFA may have more states than NFA
- D: DFA and NFA cannot be compared
View Answer
C
Q243: C++ FA simulator uses which condition to break the loop?
- A: state==initial
- B: c=='\n'
- C: state==acceptor
- D: c==EOF
View Answer
D
Q244: RE a* denotes which of the following?
- A: a only
- B: empty string only
- C: a and empty string
- D: any number of a's including none
View Answer
D
Q245: ______ automaton may transition without input.
- A: NFA
- B: DFA
- C: Neither
- D: Regex-based
View Answer
A
Q246: Thompson's Construction algorithm was introduced in the year ________.
- A: 1970
- B: 1968
- C: 1990
- D: 2001
View Answer
B
Q247: Which step follows RE to NFA in lexical analyzer construction?
- A: NFA to RE
- B: NFA to DFA
- C: DFA to syntax tree
- D: Regex simplification
View Answer
B
Q248: ______ automata are easier to implement and more efficient in execution.
- A: NFA
- B: DFA
- C: Turing Machines
- D: Linear Automata
View Answer
B
Q249: What is the main algorithm used to convert NFA to DFA?
- A: Epsilon elimination
- B: Power set construction
- C: Subset construction
- D: Transition minimization
View Answer
C
Q250: What does each state in a DFA constructed from an NFA represent?
- A: A single transition
- B: An NFA state
- C: A symbol
- D: A set of NFA states
View Answer
D