Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [2 earlier articles] |
| Re: Alternatives to Regexps torbenm@diku.dk (Torben Mogensen) (1998-07-10) |
| Re: Alternatives to Regexps jamz@cdsnet.net (1998-07-10) |
| Re: Alternatives to Regexps d.rourke@arpc.com (Daniel Rourke) (1998-07-10) |
| Re: Alternatives to Regexps bear@sonic.net (Ray Dillinger) (1998-07-10) |
| Re: Alternatives to Regexps bpr@best.com (Brian Rogoff) (1998-07-10) |
| Re: Alternatives to Regexps mav@naxos.esat.kuleuven.ac.be (Maurizio Vitale) (1998-07-10) |
| Re: Alternatives to Regexps lord@emf.emf.net (1998-07-11) |
| Re: Alternatives to Regexps bromage@cs.mu.OZ.AU (1998-07-11) |
| Re: Alternatives to Regexps cfc@world.std.com (Chris F Clark) (1998-07-13) |
| Re: Alternatives to Regexps torbenm@diku.dk (Torben Mogensen) (1998-07-13) |
| Re: Alternatives to Regexps thetick@magelang.com (Scott Stanchfield) (1998-07-20) |
| From: | lord@emf.emf.net (Tom Lord) |
| Newsgroups: | comp.compilers |
| Date: | 11 Jul 1998 23:42:22 -0400 |
| Organization: | emf.net -- Quality Internet Access. (510) 704-2929 (Voice) |
| References: | 98-07-057 |
| Keywords: | DFA, design |
The original theoretical definition of regexp's resulted in
expressions which were simple and clear and readable.
But life is always complicated and the various pragmatic
implementations of regexps sub-languages found in Perl/Emacs/grep
etc. etc. all have major extensions to the theoretic version and all
have slight differences and all have complex special case rules.
I've started using the phrase "regular expression" to refer to
expressions that describe "regular languages" (the smallest set of
languages in the Chomsky hierarchy), and the word "regexp" to refer to
elements of the larger sets of expressions recognized by
Perl/Emacs/grep etc. I hope other people will also make this
distinction.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.