From: | dmitry@elros.cbb-automation.de (Dmitry Kazakov) |
Newsgroups: | comp.compilers |
Date: | 12 Oct 2001 00:20:22 -0400 |
Organization: | Compilers Central |
References: | 01-10-029 |
Keywords: | lex |
Posted-Date: | 12 Oct 2001 00:20:22 EDT |
On 10 Oct 2001 15:52:13 -0400, "Jon Forrest" <forrest@ce.berkeley.edu>
wrote:
>I've been looking at some pretty hairy regular expressions (in Perl)
>recently that are virtually unreadable. The thought crossed my mind
>that maybe there are some alternatives to classic regular expression
>syntax out there. Note that I'm only talking about the syntax - it's
>hard to beat the semantics of regular expressions.
>
>Does anybody know of anything?
1. GNAT.Spitbol (a full implementation of SNOBOL4 patterns in Ada 95):
You can find it in a distribution of the GNAT Ada 95 compiler (it is
freeware). This is a standard part of the GNAT Ada library.
2. Snobol-like patterns (C, C++, Ada 95 interfaces):
http://www.dmitry-kazakov.de/match/match.htm
SNOBOL patterns are extermely powerful. One can build a pattern that
matches syntactically correct programs and rejects others.
Regards,
Dmitry Kazakov
Return to the
comp.compilers page.
Search the
comp.compilers archives again.