Re: LL(1) BNF validator wanted

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>
--

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