Context-Free Production Rule

languages

Definition

Context-Free Production Rule

A production rule is called context-free if it is of the form

$$A\to \beta$$

where $A\in N$ is a single non-terminal symbol and $\beta \in (N\cup T{)}^{\ast }$ is any string of non-terminal symbols and terminal symbols.

The left-hand side does not depend on the surrounding symbols.