Regular grammar
In computer science a right regular grammar is a formal grammar such that all the production rules in P are of one of the following forms:
# A → a - where A is a non-terminal in N and a is a terminal in Σ
# A → aB - where A and B are in N and a is in Σ
Discussions
|
Discussion
Features
|
|
 |
Ask a
question about 'Regular grammar' |
|
|
 |
|
 |
Start a new
discussion about 'Regular grammar' |
|
|
|
|
 |
Answer
questions about 'Regular grammar' |
|
|
|
|
 |
'Regular grammar' discussion
forum |
|
|
Encyclopedia
In computer science a right regular grammar is a formal grammar such that all the production rules in P are of one of the following forms:
A → a - where A is a non-terminal in N and a is a terminal in Σ
A → aB - where A and B are in N and a is in Σ
