|LRStar: LR(*) parser generator 9.0 released 2018-03-20. firstname.lastname@example.org (2018-03-20)|
|Date:||Tue, 20 Mar 2018 11:16:31 -0700 (PDT)|
|Injection-Info:||gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="71156"; mail-complaints-to="email@example.com"|
|Posted-Date:||20 Mar 2018 15:19:02 EDT|
New release LRStar 9.0 is now available at:
It runs on Windows and generates C++ code.
It works well with Microsoft Visual Studio C++.
It contains 6 working projects for MSVS.
It reads a modern powerful grammar notation but
also reads Yacc/Bison grammars if the code is
removed from the rules and token declarations
See the C99 project whose grammar was originally
a Yacc grammar.
LRStar is simpler and easier to use now, but
still offers the power and productivity of
The generated LR(*) parsers do lexing, parsing,
building a symbol table, creating an abstract-
syntax tree, and traversing of the AST.
LR(*) parsers are minimal LR(1) parsers with
extra information that allows nondeterministic
LR(k) parsing, if necessary. K can be set to
2, 3, 4, 5 ... by the user as a program option.
Comments and feedback from users would be
Paul B Mann
Return to the
Search the comp.compilers archives again.