In the Theory of Computation, regular expressions $($RE$)$ and context$-$free grammars $($CFG$)$

are two formalisms used to describe languages. Given the RE $1(0$U$1)*$ provide the

equivalent production rules based on the following CFG formal definition $(\{S,A\},\{0,1\},R,S.$