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: B. a finite automaton equipped with a stack
Explanation:
The suitable explanation is a finite automaton equipped with a stack.
Choose an option to check your answer.
Correct Answer: A. a tree representation of the derivation of a string from a grammar
Explanation:
The correct answer is a tree representation of the derivation of a string from a grammar.
Choose an option to check your answer.
Correct Answer: A. memory used in last-in-first-out order
Explanation:
The correct answer is memory used in last-in-first-out order.
Choose an option to check your answer.
Correct Answer: D. a tree representation of the derivation of a string from a grammar
Explanation:
parse tree is correctly described as a tree representation of the derivation of a string from a grammar.
Choose an option to check your answer.
Correct Answer: A. memory used in last-in-first-out order
Explanation:
stack in PDA is correctly described as memory used in last-in-first-out order.
Choose an option to check your answer.
Correct Answer: C. a tree representation of the derivation of a string from a grammar
Explanation:
In this course context, parse tree means a tree representation of the derivation of a string from a grammar.
Choose an option to check your answer.
Correct Answer: D. memory used in last-in-first-out order
Explanation:
In this course context, stack in PDA means memory used in last-in-first-out order.
Choose an option to check your answer.
Correct Answer: B. a rule that describes how grammar symbols may be rewritten
Explanation:
The suitable explanation is a rule that describes how grammar symbols may be rewritten.
Choose an option to check your answer.
Correct Answer: D. a tree representation of the derivation of a string from a grammar
Explanation:
The suitable explanation is a tree representation of the derivation of a string from a grammar.
Choose an option to check your answer.
Correct Answer: A. memory used in last-in-first-out order
Explanation:
The suitable explanation is memory used in last-in-first-out order.
Choose an option to check your answer.
Correct Answer: A. a sequence of production applications used to generate a string
Explanation:
The correct answer is a sequence of production applications used to generate a string.
Choose an option to check your answer.
Correct Answer: B. a grammar that generates some string with more than one parse tree
Explanation:
The correct answer is a grammar that generates some string with more than one parse tree.
