Theory of Computation (Automata)
In computer science, Context-free grammar refers to which of the following?
- A. A formal grammar in which every production rule has a single non-terminal on its left-hand side. ✓
- B. An automaton that uses a stack to recognize context-free languages.
- C. A property of a problem indicating whether an algorithm can be constructed that always provides a correct yes/no answer.
- D. A classification of formal grammars into four types based on their generative power.
Correct answer
A. A formal grammar in which every production rule has a single non-terminal on its left-hand side.
Explanation
Context-free grammar refers to a formal grammar in which every production rule has a single non-terminal on its left-hand side.