Which type of language is generated by Type-2 grammars in the Chomsky Hierarchy?
Option B is correct. Which type of language is generated by Type-2 grammars in the Chomsky Hierarchy? Answer: Context-Free Languages.
Which parser construction class corresponds to top-down deterministic CFG parsing?
Option A is correct. Which parser construction class corresponds to top-down deterministic CFG parsing? Answer: LL(1) Parser.
What is an inherently ambiguous language?
Option B is correct. What is an inherently ambiguous language? Answer: A CFL for which every CFG that generates it is ambiguous.
Are Acceptance by Final State and Acceptance by Empty Stack equivalent for Non-Deterministic PDA?
Option B is correct. Are Acceptance by Final State and Acceptance by Empty Stack equivalent for Non-Deterministic PDA? Answer: Yes, both acceptance modes accept the exact same class of Context-Free Languages.
Which language class is accepted by Two-Pushdown-Store Automata?
Option A is correct. Which language class is accepted by Two-Pushdown-Store Automata? Answer: Recursively Enumerable Languages (Equivalent to Turing Machine).