Xref: utzoo comp.compilers:700 comp.edu:2622
Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!cs.utexas.edu!uunet!lotus!esegue!compilers-sender
From: daven@ibmpcug.co.uk (D R Newman)
Newsgroups: comp.compilers,comp.edu
Subject: Re: LEX and YACC -- Are there better parser generators?
Message-ID: <1989Nov11.161606.10215@esegue.segue.boston.ma.us>
Date: 11 Nov 89 16:16:06 GMT
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: D R Newman <daven@ibmpcug.co.uk>
Organization: The IBM PC User Group, UK.
Lines: 12
Approved: compilers@esegue.segue.boston.ma.us

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.