Regular grammar is a type of grammar that describes a regular language. A regular grammar is a mathematical object, G, which consists of four components, G = (N, E, P, S), where N: non-empty, finite set of non-terminal symbols, E: a finite set of terminal symbols, or alphabet, symbols, P: a set of grammar rules, each of one having one of the forms A ⇢ aB A⇢ a A ⇢∈, Here ∈=empty string, A, B ∈ N, a ∈ ∑ S ∈ N is the start symbol. This grammar can be of two forms: Right Linear Regular Grammar Left Linear Regular Grammar Right Linear Regular Grammar In this type of regular