|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:||"Joel C. Salomon" <JoelCSalomon@Gmail.com>|
|Date:||3 Mar 2007 23:33:35 -0500|
|Organization:||Aioe.org NNTP Server|
|Keywords:||lex, parse, comment|
|Posted-Date:||03 Mar 2007 23:33:35 EST|
> 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.
On Plan 9 systems, almost all regexp-using programs use the regexp
library. Its syntax is given in
http://plan9.bell-labs.com/magic/man2html/6/regexp, in BNF. (A Unix
port is available at http://swtch.com/plan9port/unix/). POSIX regular
expressions are probably defined somewhere, I just don't know where.
[POSIX REs are defined where you'd expect, in the POSIX standard. -John]
Return to the
Search the comp.compilers archives again.