Need help checking if my CFG question is correct

Question

I need to write a CFG for the language below:

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

I came up with:

S = SΣ* | ε