TOC 3A

How many types of grammar are in Chomsky's hierarchy?

• 2

• 3

• 4

• 5

Which grammar type is most powerful?

• Type 0

• Type 1

• Type 2

• Type 3

What does CFG stand for?

• Context-Free Grammar

• Constant Finite Grammar

• Control Flow Grammar

• Contextual Free Grammar

Which device recognizes context-free languages?

• DFA

• PDA

• Turing Machine

• NFA

What does a parse tree represent?

• Finite automaton

• Grammar's structure

• State transitions

• Stack content

What causes ambiguity in a grammar?

• Multiple parse trees for a string

• Undefined terminals

• No start symbol

• Infinite productions

Which of these is a context-free grammar production?

• A → aB

• A → aB | b

• A → aAb | ε

• All of the above

PDA stands for:

• Push Down Automation

• Push Down Automata

• Pre-Defined Automaton

• Partial Deterministic Automaton

A PDA uses which data structure?

• Queue

• Tree

• Stack

• Graph

What is the initial state of a PDA called?

• Final state

• Start state

• Push state

• Root state