fjb@metaware.metaware.com (Fred Bourgeois) (11/12/89)
In article <1989Nov5.235947.2907@esegue.segue.boston.ma.us> you write: > Here's the real question: are there better parser generators than > yacc and lex which are easily available on Unix systems, ie, > available on a broad range of systems, robust, and either free or > not too expensive. ... Might I suggest the TWS (Translator Writing System) from MetaWare. The error handling is better than anything you will find in YACC based systems. The parser generated is also efficient. Further information can be found in various texts on compilers, including Barret & Couch. It is, however, not free (or cheap :-). You can also write or call MetaWare for more details. Fred Bourgeois [Insert standard disclaimers here] MetaWare, Inc. metaware!fjb@uunet.uu.net | 2161 Delaware Avenue ...!{acad,amdcad}!metaware!fjb | Santa Cruz, CA 95060-5706 -- Send compilers articles to compilers@esegue.segue.boston.ma.us {spdcc | ima | lotus}!esegue. Meta-mail to compilers-request@esegue. Please send responses to the author of the message, not the poster.
daven@ibmpcug.co.uk (D R Newman) (11/12/89)
Of course there are better parsers, especially the Declarative Clause
Grammars in Prolog. If you use a compiled Prolog, like LPA, you can even
use the parser with other languages.
OTOH, if you are only parsing a restricted language, not a natural one like
English, you don't need something so powerful - a LISP augmented transition
network will do.
[From D R Newman <daven@ibmpcug.co.uk>]
--
Send compilers articles to compilers@esegue.segue.boston.ma.us
{spdcc | ima | lotus}!esegue. Meta-mail to compilers-request@esegue.
Please send responses to the author of the message, not the poster.