MCQ Collection
Theory of Automata & Formal Languages MCQs
MCQs on automata theory, grammars, regular languages, and formal language concepts.
Choose an option to check your answer.
Correct Answer: A. a language generated by a context-free grammar
Explanation:
context-free language is correctly described as a language generated by a context-free grammar.
Choose an option to check your answer.
Correct Answer: B. a derivation that replaces the leftmost non-terminal at each step
Explanation:
In this course context, leftmost derivation means a derivation that replaces the leftmost non-terminal at each step.
Choose an option to check your answer.
Correct Answer: D. a language generated by a context-free grammar
Explanation:
In this course context, context-free language means a language generated by a context-free grammar.
Choose an option to check your answer.
Correct Answer: B. a derivation that replaces the leftmost non-terminal at each step
Explanation:
The suitable explanation is a derivation that replaces the leftmost non-terminal at each step.
Choose an option to check your answer.
Correct Answer: D. a language generated by a context-free grammar
Explanation:
The suitable explanation is a language generated by a context-free grammar.
Choose an option to check your answer.
Correct Answer: A. a derivation that replaces the rightmost non-terminal at each step
Explanation:
The correct answer is a derivation that replaces the rightmost non-terminal at each step.
Choose an option to check your answer.
Correct Answer: A. a finite automaton equipped with a stack
Explanation:
The correct answer is a finite automaton equipped with a stack.
Choose an option to check your answer.
Correct Answer: A. a derivation that replaces the rightmost non-terminal at each step
Explanation:
rightmost derivation is correctly described as a derivation that replaces the rightmost non-terminal at each step.
Choose an option to check your answer.
Correct Answer: A. a finite automaton equipped with a stack
Explanation:
PDA is correctly described as a finite automaton equipped with a stack.
Choose an option to check your answer.
Correct Answer: A. a derivation that replaces the rightmost non-terminal at each step
Explanation:
In this course context, rightmost derivation means a derivation that replaces the rightmost non-terminal at each step.
Choose an option to check your answer.
Correct Answer: C. a finite automaton equipped with a stack
Explanation:
In this course context, PDA means a finite automaton equipped with a stack.
Choose an option to check your answer.
Correct Answer: B. a derivation that replaces the rightmost non-terminal at each step
Explanation:
The suitable explanation is a derivation that replaces the rightmost non-terminal at each step.
