|RegExp to match against RegExp's email@example.com (whiskey) (2007-03-01)|
|Re: RegExp to match against RegExp's JoelCSalomon@Gmail.com (Joel C. Salomon) (2007-03-03)|
|Re: RegExp to match against RegExp's firstname.lastname@example.org (Russ Cox) (2007-03-05)|
|Re: RegExp to match against RegExp's email@example.com (Thomas Dickey) (2007-03-08)|
|Re: RegExp to match against RegExp's firstname.lastname@example.org (whiskey) (2007-03-14)|
|From:||Thomas Dickey <email@example.com>|
|Date:||8 Mar 2007 09:43:10 -0500|
|Organization:||RadixNet Internet Services|
|Posted-Date:||08 Mar 2007 09:43:10 EST|
Joel C. Salomon <JoelCSalomon@gmail.com> wrote:
> whiskey wrote:
>> how would a regular expression that matches a regular
>> expression look like ?
> Which flavor of regexp? But that hardly matters; since parenthesis and
> brackets must be matched in a valid regexp, regular expressions cannot
> themselves be described by a regular language.
otoh, I got reasonably good (but bulky) results for the parser of lex
source written in lex/flex for vile. It took several levels of expressions
to do that, though.
Thomas E. Dickey
Return to the
Search the comp.compilers archives again.