Related articles |
---|
RegExp to match against RegExp's alex.habar.nam@gmail.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 rsc@swtch.com (Russ Cox) (2007-03-05) |
Re: RegExp to match against RegExp's dickey@saltmine.radix.net (Thomas Dickey) (2007-03-08) |
Re: RegExp to match against RegExp's alex.habar.nam@gmail.com (whiskey) (2007-03-14) |
From: | Thomas Dickey <dickey@saltmine.radix.net> |
Newsgroups: | comp.compilers |
Date: | 8 Mar 2007 09:43:10 -0500 |
Organization: | RadixNet Internet Services |
References: | 07-03-003 07-03-019 |
Keywords: | lex |
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
http://invisible-island.net
ftp://invisible-island.net
Return to the
comp.compilers page.
Search the
comp.compilers archives again.