Alternatives to Regexps

John Carter <john@dwaf-hri.pwv.gov.za>
8 Jul 1998 01:34:43 -0400

          From comp.compilers
Related articles
Alternatives to Regexps john@dwaf-hri.pwv.gov.za (John Carter) (1998-07-08)
Re: Alternatives to Regexps ak@muc.de (1998-07-10)
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)
[6 later articles]
| List of all articles for this month |
From: John Carter <john@dwaf-hri.pwv.gov.za>
Newsgroups: comp.compilers
Date: 8 Jul 1998 01:34:43 -0400
Organization: Compilers Central
Keywords: DFA, design

Greetings folk,


I'm seeking pointers to alternatives to standard regular expression
languages.


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.


So what I'm seeking are pointers to a far more readable, elegant and
consistent pragmatic pattern recognition language.


Thank you,


John Carter EMail: ece@dwaf-hri.pwv.gov.za
Telephone : 27-12-808-0374x194 Fax:- 27-12-808-0338
<http://www.geocities.com/SoHo/Cafe/5947> or <http://iwqs.pwv.gov.za>
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.