|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 (Gary Funck)|
|Keywords:||tools, PCCTS, LL(1)|
|Organization:||Intrepid Technology, Inc.|
|Date:||Wed, 2 Feb 1994 15:27:32 GMT|
: Is there a tool out there that can take a BNF (or BNF-like)
: description of a language and indicate all parts of the grammar that
: are not LL(1)? YACC is a last resort, since I have to do more to the
: BNF grammar than I would like.
The Purdue Compiler Compiler Toolset (PCCTS) has a parser generator called
ANTLR that will produce a parser in C (or C++) for an LL(K) grammar,
described by an extended BNF syntax. You can specify the value of 'K' for
LL(K) that you want ANTLR to use; also lexical analysis descriptions can
be integrated into the same grammar description that you pass to ANTLR.
PCCTS is available via FTP from marvin.ecn.purdue.edu. There is also an
active mailing list for PCCTS users.
Gary Funck email@example.com [uunet!uupsi!intrpd!gary]
Intrepid Technology Inc., Mountain View CA (415) 964-8135
Return to the
Search the comp.compilers archives again.