Which formal language class corresponds to Type-2 grammars in the Chomsky Hierarchy?
Option D is correct. More than one of the options (A, B, and C) are valid answers.
Which type of Pushdown Automaton is equivalent in computational power to a Universal Turing Machine?
Option A is correct. Which type of Pushdown Automaton is equivalent in computational power to a Universal Turing Machine? Answer: A Pushdown Automaton equipped with two auxiliary stacks (Two-Stack PDA).
What is the yield of a parse tree?
Option C is correct. What is the yield of a parse tree? Answer: The string formed by concatenating all leaves of the parse tree from left to right.
What is an inherently ambiguous Context-Free Language?
Option B is correct. What is an inherently ambiguous Context-Free Language? Answer: A Context-Free Language for which EVERY generating CFG is ambiguous.
Which of the following parsing models uses a top-down approach without backtracking by looking ahead 1 token?
Option C is correct. Which of the following parsing models uses a top-down approach without backtracking by looking ahead 1 token? Answer: LL(1) Parser.