is the language of regular expressions a regular language?



The set REX of regular expressions over the alphabet
{a, b}
is itself a language over the alphabet
{e,0 , a, b, ), (*,U, .}

is this language regular?

I want to say yes, however, I am not sure what approach to take?
Which would be easiest? Construct a DFA or a regular expression?
Or am I wrong and this language is not regular?
.



Relevant Pages

  • Re: acceptance of forth (was: Re: continued fractions)
    ... But most every scripting language these days offers one ... this is provided by the language itself. ... is classic regular expressions are "greedy" so matching on shortest- ... string in that language and execute it), here are some of the big ...
    (comp.lang.forth)
  • Decidabilty of a problem of regular languages
    ... where S is a finite number of states, A an alphabet, TO a finite set ... of transitions labeled with regular expressions sigma built from A. ... Exists a path between 's' and 'r', such that the language ... language generated by alpha? ...
    (comp.theory)
  • Re: Regular express for

    ,

      and
        tags
        ... Not only not a real language, Html is not a regular expression. ... using regular expressions. ... so they might be powerful enough to parse context-sensitive languages. ...
        (comp.lang.perl.misc)
      1. Re: Regular express for

        ,

          and
            tags
            ... Not only not a real language, Html is not a regular expression. ... using regular expressions. ... so they might be powerful enough to parse context-sensitive languages. ...
            (comp.lang.perl.misc)
          1. Re: Search for multiple things in a string
            ... >> language in places. ... > None of those state that regular expressions aren't a language. ... And the Regex version: ... But the fact a junior programmer might not understand Objects as you do ...
            (microsoft.public.dotnet.languages.csharp)