|LRGEN 9.0: fast LALR parser generator email@example.com (Paul B Mann) (2010-07-30)|
|Re: LRGEN 9.0: fast LALR parser generator firstname.lastname@example.org (Paul Mann) (2010-07-30)|
|From:||"Paul B Mann" <email@example.com>|
|Date:||Fri, 30 Jul 2010 01:26:26 -0500|
|Posted-Date:||30 Jul 2010 10:49:15 EDT|
The LRGEN 9.0 is now available for free at:
LRGEN is an LALR parser generator which creates very-fast parsers in
C/C++, 2 times the speed of yacc parsers. Includes the DFAC lexer
generator which creates DFA lexers, 2 times the speed of flex lexers.
Includes compiler front-end source code in C/C++, portable to Linux,
UNIX, MacOS and others (may require some minor modifications).
LRGEN reads TBNF grammar notation, which is very powerful for defining
compiler front-ends. It creates compressed matrix parser tables for
high-performance parsing (500,000 lines per second or more). It
creates parsers that build an abstract- syntax tree (AST)
automatically. It creates small parsers for LALR(1) computer
languages. It is capable of building parsers from grammars that have
70,000 rules or more.
20 BNF grammar are also available on the website for FREE, including:
Cobol 85, Visual Basic, Fortran 77, CICS, PL./I, PL/M, C, Pascal, Modula-2,
Ada, SQL, dBASE and Zeus.
LRGEN can do LR(1) grammar analysis now, but not LR(1) parsers yet. I'm
working on that.
Also download the DFAC lexer generator. It's free too.
These products run on Window 32-bit machines and work very well with
Microsoft Visual C++ 2008.
A Linux version may be available in the future if there is sufficient
Comments are welcome.
Paul B Mann
Return to the
Search the comp.compilers archives again.