Find a context free grammar G to generate the language R which is a langauge of regular expressions over the alphabet {a,b}. When making your context free grammar , the alphabet of your grammar is .

The goal is to give a set of rules that will generate all regular expressions.

={a, b, +,-,*, (.)}