Theory of Computation (Automata)
What term describes the following? a formal grammar in which every production rule has a single non-terminal on its left-hand side.
- A. Alphabet
- B. Deterministic finite automaton (DFA)
- C. Context-free grammar ✓
- D. Non-deterministic finite automaton (NFA)
Correct answer
C. Context-free grammar
Explanation
Context-free grammar refers to a formal grammar in which every production rule has a single non-terminal on its left-hand side.