How do I represent this regular expression in regular grammar? Question: Is the regular expression and regular grammar equivalent?
I've look on some examples of regular grammar however I don't think I fully understand how to convert regular expression to its equivalent grammar. So I am also asking for some help or tips to convert regular expression to regular grammar.
*Key
() -&gt; empty string*
Regular Expression :
a* (ba (cf* (g (f + j)* b f*)*  e)* a)*
Regular Grammar:
S-&gt; aS| ()
F-&gt; f F| ()
Q-&gt; fQ | jQ | ()
G -&gt; gQB|()
C-&gt; cFGE| ()
E-&gt; eC
M -&gt; baCA|()
A -&gt; aM
LM = {L1 | L1= SM }
They are equivalent in the sense that every language that can be represented with a regular expression, can be represented with a regular grammar; and vice versa.
Also, you can convert any regular grammar to a regular expression that generates the same language, and vice versa.