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-sensitive grammar
Explanation:
The correct answer is a language generated by a context-sensitive grammar.
Choose an option to check your answer.
Correct Answer: C. input is accepted when the PDA reaches an accepting state after processing input
Explanation:
PDA acceptance by final state is correctly described as input is accepted when the PDA reaches an accepting state after processing input.
Choose an option to check your answer.
Correct Answer: D. a production that derives the empty string
Explanation:
epsilon production is correctly described as a production that derives the empty string.
Choose an option to check your answer.
Correct Answer: D. the process of analyzing a string according to a grammar
Explanation:
parsing is correctly described as the process of analyzing a string according to a grammar.
Choose an option to check your answer.
Correct Answer: B. input is accepted when the PDA reaches an accepting state after processing input
Explanation:
In this course context, PDA acceptance by final state means input is accepted when the PDA reaches an accepting state after processing input.
Choose an option to check your answer.
Correct Answer: C. a production that derives the empty string
Explanation:
In this course context, epsilon production means a production that derives the empty string.
Choose an option to check your answer.
Correct Answer: D. the process of analyzing a string according to a grammar
Explanation:
In this course context, parsing means the process of analyzing a string according to a grammar.
Choose an option to check your answer.
Correct Answer: A. a sequence of production applications used to generate a string
Explanation:
The suitable explanation is a sequence of production applications used to generate a string.
Choose an option to check your answer.
Correct Answer: C. a grammar that generates some string with more than one parse tree
Explanation:
The suitable explanation is a grammar that generates some string with more than one parse tree.
Choose an option to check your answer.
Correct Answer: C. a derivation that replaces the leftmost non-terminal at each step
Explanation:
The correct answer 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 correct answer is 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:
leftmost derivation is correctly described as a derivation that replaces the leftmost non-terminal at each step.
