You are on page 1of 11

Regular Grammar

• Some Definitions:-

• Any set represented by regular expression is called


Regular Set.

• The class of Regular sets over ∑ is Regular Language


over the terminal set ∑.

• Grammar for Regular Expression is Regular Grammar.


• Converting Regular Expression to Regular
Grammar:-

• Then we construct Grammar as :-

Example 1 :-
• Construct a regular grammar G generating the regular set represented by
P= (a+b)*abb
P=(ab+c)*+ab
• Converting Regular Grammar to Regular
Expression and Transition System:-

Then we construct a transition system :-


Example :-
• Example:
Linear grammars
The Linear Grammars are either left or right:
Right Linear Left Linear
Grammars: Grammars:
Rules of the forms Rules of the forms
A→ε A→ε
A→a
A→a
A → aB
A → Ba
A,B: variables and A,B: variables and
a: terminal A: terminal