Q6Theory of Computation

A Context-Free Grammar (CFG) is a 4-tuple $(V,\Sigma ,R,S)$ where every production rule is of the form $A\to \alpha$, where $A$ is a single non-terminal and $\alpha$ is a string of terminals and/or non-terminals.