Clone wiki

inf225public / glossary / Regular grammar

[Alphabetical Index | Tag Index]

Regular grammar

A formal Grammar where every production rule has the form A → aB (for a right regular grammar), or A → a or A → ε, where A and B are nonterminal symbols and a is a Terminal symbol, and ε is the empty string. Alternatively, the first production form may be A → Ba, for a left regular grammar.


Can't express arbitrary nesting, such as nested parentheses or block structure in a language.