Re: LL(1) BNF validator wanted

mw@ipx2.rz.uni-mannheim.de (Marc Wachowitz)
Mon, 31 Jan 1994 23:21: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)
[1 later articles]
| List of all articles for this month |

Newsgroups: comp.compilers
From: mw@ipx2.rz.uni-mannheim.de (Marc Wachowitz)
Keywords: tools, LL(1)
Organization: Compilers Central
References: 94-01-135
Date: Mon, 31 Jan 1994 23:21:46 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)?


You may try COCO/R, which was announced here a few days ago. It accepts the
popular Extended BNF (repetition = {}, option = [], alternative = | etc.),
and generates a recursively descending parser (scanner & help for semantic
actions also supported). It is available as Oberon and Modula-2 source code
and MS-DOS executable.


        neptune.inf.ethz.ch:/Coco <--- Oberon version
        ftp.psg.com:/pub/modula-2/coco <--- you guess it :-)
        alpha.ru.ac.za:/pub/coco <--- don't know
        plutu.fit.qut.edu.au:/pub/coco <--- don't know
--
Marc Wachowitz <mw@ipx2.rz.uni-mannheim.de>
--


Post a followup to this message

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