Table-driven parsers to help you with your work.
LRSTAR Parser Generator is a handy, easy to use, command line based LALR parser generator that generates very-fast parsers in C/C++, 2 times the speed of YACC parsers. It comes with the DFAC lexer generator and compiler front-end source code in C/C++.
It reads TBNF grammar notation, which is very powerful for defining compiler front-ends. LRSTAR creates compressed matrix parser tables for high-performance parsing (500,000 lines per second or more). It creates parsers that build a symbol table and abstract-syntax tree (AST) automatically. LRSTAR is capable of building parsers from grammars that have 70,000 rules or more.
Works very well with the DFAC lexer generator
It reads TBNF grammar notation, which is very powerful for defining compiler front-ends. LRSTAR creates compressed matrix parser tables for high-performance parsing (500,000 lines per second or more). It creates parsers that build a symbol table and abstract-syntax tree (AST) automatically. LRSTAR is capable of building parsers from grammars that have 70,000 rules or more.
Works very well with the DFAC lexer generator
| Developer: License / Price: Size / OS: Last Updated: | Paul B. Mann GPL / FREE 1 MB / Windows All August 26th, 2010 |
| Download: | LRSTAR Parser Generator 1.0.372 |