Regular Grammar and Regular Expressions are different.
We have discussed Regular expressions. Let’s see Regular Grammar.
Formal Definition of Regular Grammar:
In Computer Science, a right regular grammar is a formal grammar (N, Σ, P, S) such that all the production rules in P are of one of the following forms:
1. A → a - where A is a non-terminal in N and a is a terminal in Σ
2. A → aB - where A and B are in N and a is in Σ
3. A → ε - where A is in N and ε denotes the empty string, i.e. the string of length 0.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment