1.Previous
3.Next

including non-regular ones.

For instance, the grammar G with N = {S, A}, ? = {a, b}, P with start symbol S and rules
: S -> aA
: A -> Sb
: S -> ?generates , the paradigmatic non-regular linear language.

See also

* Regular expression, a compact notation for regular grammars
* Regular tree grammar, a generalization from strings to trees
* Prefix grammar
* Chomsky hierarchy

1.Previous
3.Next