Regular grammar is used to represent a regular language.
Regular grammar comprises rules in the form of A -> a, A -> aB, and many more. The rules help detect and analyze strings by automated computation.
Regular grammar consists of four tuples:
‘N’ is used to represent the non-terminal set.
‘∑’ represents the set of terminals.
‘P’ stands for the set of productions.
‘S € N’ denotes the start of non-terminal.
Regular grammar is of 2 types:
(a) Left Linear Grammar(LLG)
(b) Right Linear Grammar(RLG)