An LALR(1) and LALR(*) parser generator.
Generates parsers up to 140 times the speed of ANTLR parsers,
and 1/10th of the size or smaller.
Contains the DFA lexer generator, 80% faster than flex lexers.
Works with Visual Studio C++.
Contains 27 grammars.
Parsers build a symbol table.
Parsers construct an abstract-syntax tree (AST).
Parser are very fast and small.
Reads ANTLR and YACC grammars, after making some changes.
Accepts advanced EBNF grammar notation.
Includes 4 sample projects.
Source code compiles on Windows and Linux.
Support is available.
Contact me at:
paul@paulbmann.com
.
License
BSD LicenseFollow LRSTAR parser generator for C++
Other Useful Business Software
Our Free Plans just got better! | Auth0
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Rate This Project
Login To Rate This Project
User Reviews
-
The first time I used this software was in the early 80's, and back then it was called LALR. Easy to use then, easy to use now. And very powerful to say the least. In fact, a parser that I wrote for a NASA program is still in use to this day. Not exactly sure how that is (we are talking DOS here folks). Now I would like to offer a little criticism, although it may be unfounded as I am visually handicapped now and quite often miss things. Also, this is completely free. I really have no ground to stand on to complain. Unless I missed it, I was not able to find a "user manual" in the zip files. A lot of things have changed in 40 years. I did manage to find one for an older version by searching around, but several details that would be nice to know would be handy. But this is the only short coming. And like I said, I can't complain, it is free. I am going through all of the examples and the code to try and clear this up.