Re: LL(1) BNF validator wanted

parag@netcom.com (Parag Patel)
Tue, 1 Feb 1994 19:08:46 GMT

          From comp.compilers
Related articles
LL(1) BNF validator wanted emp@xgml.com (1994-01-31)
Re: LL(1) BNF validator wanted mw@ipx2.rz.uni-mannheim.de (1994-01-31)
Re: LL(1) BNF validator wanted Michael.Bergman@eua.ericsson.se (1994-02-01)
Re: LL(1) BNF validator wanted parag@netcom.com (1994-02-01)
Re: LL(1) BNF validator wanted anton@mips.complang.tuwien.ac.at (1994-02-02)
Re: LL(1) BNF validator wanted gary@intrepid.com (1994-02-02)
Re: LL(1) BNF validator wanted dave@cs.arizona.edu (1994-02-02)
Re: LL(1) BNF validator wanted parrt@s1.arc.umn.edu (Terence Parr) (1994-02-04)
Re: LL(1) BNF validator wanted adrian@dcs.rhbnc.ac.uk (1994-02-06)
| List of all articles for this month |
Newsgroups: comp.compilers
From: parag@netcom.com (Parag Patel)
Keywords: tools, LL(1)
Organization: Code Generation Technology
References: 94-01-135 94-01-144
Date: Tue, 1 Feb 1994 19:08:46 GMT

You can also try my old "wacco" program which generates an LL(1) C++
parser. It'll complain if the grammar isn't LL(1). It's also got a debug
option to spit out all FIRST and FOLLOW sets, if that's useful.


I'd originally written it just to verify LL(1) and to spit out the sets to
make it easier to write parsers by hand. It turned out to be easy to hack
it into generating the parser directly.


It should be still in comp.source.misc archives. I don't have that
version handy but I should be able to dig it up if you can't. I've been
meaning to post an updated version but just haven't had the time.


-- Parag Patel <parag@netcom.com>
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.