I need to check if my CFG productions is correct

Question

L = { w ∈ Σ* | w is a regular expression over a binary alphabet }

I came up with:

S -> S U S | SS | S* | (S) | 0 | 1 | ∅ | e