Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!think.com!mintaka!spdcc!iecc!compilers-sender
From: mailrus!sharkey!hela!iti.org!dhw@uunet.UU.NET 	 id AA00722; Tue, 20 Nov 90 15:41:42 -0500 (David H. West)
Newsgroups: comp.compilers
Subject: Re: Recursive Descent Parsers and YACC
Keywords: parse, yacc, design, question
Message-ID: <1990Nov20.204136.671@iti.org>
Date: 20 Nov 90 20:41:36 GMT
References: <F7p?bk63@cs.psu.edu> <11678@hubcap.clemson.edu>
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: mailrus!sharkey!hela!iti.org!dhw@uunet.UU.NET (David H. West)
Organization: Industrial Technology Institute
Lines: 17
Approved: compilers@iecc.cambridge.ma.us
Apparently-To: hela!uunet!comp-compilers

In article <11678@hubcap.clemson.edu> grimlok@hubcap.clemson.edu (Mike Percy) writes:
>the recursive descent parser generators I've worked on/with  [...]

>If you want to get a parser up quickly, use an Early's algorithm-based
>parser.  

Does anyone know of any of the above kinds of parser freely available in
source?

-David West      dhw@iti.org
[Quite a while ago I used an Earley parser in IMP-10, but I haven't seen
one lately.  Personally, I think the effort spent in pushing a grammar into
LALR or LL(k) is usually worth it, one often finds surprising ambiguities.
-John]
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.