Generate fast LALR(k) parsers and DFA lexical analyzers in C++
LRSTAR generates LALR(k) parsers, lexical analyzers, and compiler front-ends that run at twice the speed of Bison and Flex. The generated parsers can create abstract-syntax trees (AST's) automatically. Comes with MS Visual Studio projects and 20 BNF grammars. All the source code is included and all of it compiles with GCC. It may work fine on your machine after compiling. It has been tested on Windows, by the author and on other systems by other people.
Be the first to post a review of LRSTAR: LALR(k) parser generator for C++!