Regular Grammar | Left Linear Grammar (LLG) | Right Linear Grammar (RLG)

Right Linear Grammar :
If all productions of the given grammar follows one of the following rules then that is Right Linear grammar(RLG).

A == wB or
A == w

Where, A, B are variables & w is a string of only terminals.

Left Linear Grammar :
If all productions of the given grammar follows one of the following rules then that is Left Linear grammar(LLG).

A==Bw or
A==w

Where, A, B are variables & w is a string of only terminals.

Regular Grammar :
Grammar is regular if it is Right Linear / Left Linear.
Languages accepted/ generated by FA are called as Regular languages & grammar build for such a languages is called as Regular Grammar.

Link for video on Conversion of FA to Regular Grammar is as below:

#cfg #grammar #dfa #sppu #automata #automatatheory #computer #nfa #re #regular_expression #leftandright #leftlineargrammar #right #llg #rlg #regular #regulargrammar #toc