# Is set of all regular languages on a specific alphabet a regular language?

so i know that the set of all strings over any finite alphabet is countable, but this question is different

so if our language is set of all regular languages(or set of all regular expressions) on a specific and finite alphabet, then is this set regular? if not then what is it? CFL?

i really can't come up with any FA that can accept this!

• The set of all regular languages is a set of sets of strings; a language is a set of strings. Therfore, a set of languages can't itself be a language. – David Richerby Mar 3 '18 at 23:17
• Regular languages and regular expressions are different things. The latter are descriptions of the former. For instance, different expressions can describe the same language. – reinierpost Mar 3 '18 at 23:25

$$E ::= 0 | 1 | (E)^* | E E | (E|E)$$