Home »
MCQs »
Theory of Computation MCQs
Context-free grammar can be recognized by ____
60. Context-free grammar can be recognized by ____.
- Finite Automaton
- Pushdown Automaton
- Turing Machine
Answer: B) Pushdown Automaton
Explanation:
Context-free grammar can be recognized by the pushdown automaton.