2020. Two bugs were fixed. LRSTAR 20.0.001 was built with
version 20.0.000, so it looks very stable now. Allows two
arguments for a node name, same as for a parse action.
May be useful to somebody.
2020. LR(*) parsing, less complicated options, improved
conflict listing in HTML, improved state-machine listing in HTML,
minor bug fixes in several places, an improved /o option, a new /ci option,
hex values (#FF) in lexical grammars.
Includes 23 grammars and 6 examples.
2020. Has the new parallel LR(*) lookahead algorithm and
a new HTML state machine listing. Reads ANTLR and YACC grammars,
after some modifications are made to the grammar.
2020. No more skeleton files required, easier to
make changes in the code.
2013. Introduced an LR(*) lookahead algorithm.
2003. Generates LALR parsers in the C++ language.
2000. Offers a Windows 32-bit version.
1990. Provides the fastest table-driven parsers, EBNF grammar
notation, and AST construction, $495.
1987. Released the LALR parser generator, DFA lexer generator and
compiler front-end source code in the C language, $99.
1985. Released the "LALR(1) Grammar Analyzer and Parser-Table Generator
for IBM PC's" for $50.