How can I convert some regular language to its equivalent Context Free Grammar(CFG)?
Whether the DFA corresponding to that regular expression is required to be constructed or is there some rule for the above conversion?
For example, considering the following regular expression
01+10(11)*
How can I describe the grammar corresponding to the above RE?