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) |
Re: Alternatives to Regexps mav@naxos.esat.kuleuven.ac.be (Maurizio Vitale) (1998-07-10) |
[5 later articles] |
From: | ak@muc.de |
Newsgroups: | comp.compilers |
Date: | 10 Jul 1998 20:52:29 -0400 |
Organization: | [posted via] Leibniz-Rechenzentrum, Muenchen (Germany) |
References: | 98-07-057 |
Keywords: | DFA |
John Carter <john@dwaf-hri.pwv.gov.za> writes:
> So what I'm seeking are pointers to a far more readable, elegant and
> consistent pragmatic pattern recognition language.
Search the net for SNOBOL4. One implementation of the pattern matching
part of SPITBOL (variant) is included with the GNAT Ada Compiler.
-Andi
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.