|LL(1) BNF validator wanted firstname.lastname@example.org (1994-01-31)|
|Re: LL(1) BNF validator wanted email@example.com (1994-01-31)|
|Re: LL(1) BNF validator wanted Michael.Bergman@eua.ericsson.se (1994-02-01)|
|Re: LL(1) BNF validator wanted firstname.lastname@example.org (1994-02-01)|
|Re: LL(1) BNF validator wanted email@example.com (1994-02-02)|
|Re: LL(1) BNF validator wanted firstname.lastname@example.org (1994-02-02)|
|Re: LL(1) BNF validator wanted email@example.com (1994-02-02)|
|Re: LL(1) BNF validator wanted firstname.lastname@example.org (Terence Parr) (1994-02-04)|
|Re: LL(1) BNF validator wanted email@example.com (1994-02-06)|
|From:||firstname.lastname@example.org (Parag Patel)|
|Organization:||Code Generation Technology|
|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 <email@example.com>
Return to the
Search the comp.compilers archives again.