Beginner
Theory of Computation
Q6 / 100
What is a context-free grammar (CFG)?
Correct! Well done.
Incorrect.
The correct answer is A) A grammar where every production replaces a single non-terminal
A
Correct Answer
A grammar where every production replaces a single non-terminal
Explanation
In a CFG, each production rule has a single non-terminal on the left side (A → α). CFGs generate context-free languages, recognized by pushdown automata.
Progress
6/100