home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!gatech!rutgers!faatcrl!iecc!compilers-sender
- From: fm04@rummelplatz.uni-mannheim.de
- Newsgroups: comp.compilers
- Subject: Re: A Non-LALR(1) Parser Generator
- Keywords: parse, LALR, LL(1), comment
- Message-ID: <92-08-151@comp.compilers>
- Date: 25 Aug 92 14:55:46 GMT
- References: <92-08-104@comp.compilers>
- Sender: compilers-sender@iecc.cambridge.ma.us
- Reply-To: fm04@rummelplatz.uni-mannheim.de
- Organization: RUM
- Lines: 31
- Approved: compilers@iecc.cambridge.ma.us
-
- There's also another Non-LALR parser generetor: "ell". It's part of a
- compiler toolbox and processes LL-Grammars with EBNF notation. Here's an
- extract of the README file from the distribution:
-
- Lalr is a LALR(1) parser generator accepting grammars writ-
- ten in extended BNF notation which may be augmented by semantic
- actions expressed by statements of the target language. [...]
-
- Ell is a LL(1) parser generator accepting the same specifi-
- cation language as Lalr except that the grammars must obey the
- LL(1) property. It is possible to evaluate an L-attribution
- during parsing. The generated parsers include automatic error
- recovery, error messages, and error repair like Lalr. The
- parsers are implemented following the recursive descent method
- and reach a speed of 810,000 lines per minute. The possible tar-
- get languages are again C and Modula-2."
-
- You get get the sources & documentation from:
- iraun1.ira.uka.de (/pub/programming/cocktail)
-
- Look at the README file for Information about Authors, Copyrights, Instal-
- lation, etc.
-
- - Michael
- --
- Michael Utech, Max-Planck-str.26, 6806 Viernheim, Germany (06204/4031)
- email: fm04@rummelplatz.uni-mannheim.de, utech@informatik.uni-kl.de,
- [See message 92-03-025 for more details on Cocktail. -John]
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-