Re: LL(1) BNF validator wanted

gary@intrepid.com (Gary Funck)
Wed, 2 Feb 1994 15:27:32 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: gary@intrepid.com (Gary Funck)
Keywords: tools, PCCTS, LL(1)
Organization: Intrepid Technology, Inc.
References: 94-01-135
Date: Wed, 2 Feb 1994 15:27:32 GMT

emp@xgml.com wrote:
: 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 gary@intrepid.com [uunet!uupsi!intrpd!gary]
Intrepid Technology Inc., Mountain View CA (415) 964-8135
--

Post a followup to this message

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