Regular grammar
In theoretical computer science and formal language theory, a regular grammar is a formal grammar that is right-regular or left-regular. Every regular grammar describes a regular language.
Strictly regular grammars
A right regular grammar (also called right linear grammar) is a formal grammar (N, Σ, P, S) such that all the production rules in P are of one of the following forms:
- B → a - where B is a non-terminal in N and a is a terminal in Σ
- B → aC - where B and C are non-terminals in N and a is in Σ
- B → ε - where B is in N and ε denotes the empty string, i.e. the string of length 0.
In a left regular grammar (also called left linear grammar), all rules obey the forms
- A → a - where A is a non-terminal in N and a is a terminal in Σ
- A → Ba - where A and B are in N and a is in Σ
- A → ε - where A is in N and ε is the empty string.
A regular grammar is a left or right regular grammar.
Some textbooks and articles disallow empty production rules, and assume that the empty string is not present in languages.
Examples
An example of a right regular grammar G with N = {S, A}, Σ = {a, b, c}, P consists of the following rules
- S → aS
- S → bA
- A → ε
- A → cA
and S is the start symbol. This grammar describes the same language as the regular expression a*bc*, viz. the set of all strings consisting of arbitrarily many "a"s, followed by a single "b", followed by arbitrarily many "c"s.
A somewhat longer but more explicit extended right regular grammar G for the same regular expression is given by N = {S, A, B, C}, Σ = {a, b, c}, where P consists of the following rules:
- S → A
- A → aA
- A → B
- B → bC
- C → ε
- C → cC
…where each uppercase letter corresponds to phrases starting at the next position in the regular expression.
As an example from the area of programming languages, the set of all strings denoting a floating point number can be described by a right regular grammar G with N = {S, A,B,C,D,E,F}, Σ = {0,1,2,3,4,5,6,7,8,9,+,-,.,e}, where S is the start symbol, and P consists of the following rules:
S → +A A → 0A B → 0C C → 0C D → +E E → 0F F → 0F S → -A A → 1A B → 1C C → 1C D → -E E → 1F F → 1F S → A A → 2A B → 2C C → 2C D → E E → 2F F → 2F A → 3A B → 3C C → 3C E → 3F F → 3F A → 4A B → 4C C → 4C E → 4F F → 4F A → 5A B → 5C C → 5C E → 5F F → 5F A → 6A B → 6C C → 6C E → 6F F → 6F A → 7A B → 7C C → 7C E → 7F F → 7F A → 8A B → 8C C → 8C E → 8F F → 8F A → 9A B → 9C C → 9C E → 9F F → 9F A → .B C → eD F → ε A → B C → ε
Extended regular grammars
An extended right regular grammar is one in which all rules obey one of
- A → a - where A is a non-terminal in N and a is a terminal in Σ
- A → wB - where A and B are in N and w is in Σ^{*}
- A → ε - where A is in N and ε is the empty string.
Some authors call this type of grammar a right regular grammar (or right linear grammar) and the type above a strictly right regular grammar (or strictly right linear grammar).
An extended left regular grammar is one in which all rules obey one of
- A → a - where A is a non-terminal in N and a is a terminal in Σ
- A → Bw - where A and B are in N and w is in Σ^{*}
- A → ε - where A is in N and ε is the empty string.
Expressive power
There is a direct one-to-one correspondence between the rules of a (strictly) left regular grammar and those of a nondeterministic finite automaton, such that the grammar generates exactly the language the automaton accepts. Hence, the left regular grammars generate exactly all regular languages. The right regular grammars describe the reverses of all such languages, that is, exactly the regular languages as well.
Every strict right regular grammar is extended right regular, while every extended right regular grammar can be made strict by inserting new nonterminals, such that the result generates the same language; hence, extended right regular grammars generate the regular languages as well. Analogously, so do the extended left regular grammars.
If empty productions are disallowed, only all regular languages that do not include the empty string can be generated.
While regular grammars can only describe regular languages, the reverse is not true: regular languages can also be described by non-regular grammars.
Mixing left and right regular rules
If mixing of left-regular and right-regular rules is allowed, we still have a linear grammar, but not necessarily a regular one. What is more, such a grammar need not generate a regular language: all linear grammars can be easily brought into this form, and hence, such grammars can generate exactly all linear languages, including nonregular 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
- Perrin, Dominique (1990), "Finite Automata", in Leeuwen, Jan van, Formal Models and Semantics, Handbook of Theoretical Computer Science, B, Elsevier, pp. 1–58
- Pin, Jean-Éric (Oct 2012). Mathematical Foundations of Automata Theory (PDF)., chapter III