| Automata and Grammars | ||
| Formal definitions of a Grammar
A grammar G is defined as a quadruple.
N is a non-empty finite set of non-terminals or variables,
The binary relation defined by the set of production rules is denoted by In other words, P is a finite set of production rules of the form |
||