LRSTAR parser generator for C++

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.
.
.