Prove that the following languages are context-free by giving grammars that accept them

I am not sure if this valid, but this is my proof :

The set } is context –free. We construct a CFG to prove this proposition.

Let Σ={ …, }, then the following CFG accepts S.

S→ | |…| | ϵ

→ |

→ |

…

→ |