Is set of all regular languages on a specific alphabet a regular language?
The language of regular expressions is context-free, but not regular.  It is given by the following grammar:

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

Because of the parenthesis matching effect, it's not regular -- the language of matched parentheses is not regular.