Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!elroy.jpl.nasa.gov!ncar!hsdndev!spdcc!iecc!compilers-sender
From: ccicpg!conexch!mikee@uunet.uu.net
Newsgroups: comp.compilers
Subject: LL(k) parser generator wanted
Keywords: LL(1), question, parse
Message-ID: <9103080744.AA25691@ccicpg>
Date: 7 Mar 91 21:34:03 GMT
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: ccicpg!conexch!mikee@uunet.uu.net
Organization: Compilers Central
Lines: 10
Approved: compilers@iecc.cambridge.ma.us


   I'm looking for an LL(k) parser generator, preferably one which
produces language-independent output.  Something like the LLGen 
program described in Fischer & LeBlanc, "Crafting a Compiler" would
be ideal.  Any suggestions?
[There's llama in Holub's book, but it generates C code wrapped around its
tables.  You can get source and modify it. -John]
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.