DownloadAn 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.
.
.
License
BSD LicenseFollow LRSTAR parser generator for C++
You Might Also Like
Take away the pain and hassle associated with applicant recruitment, hiring, and onboarding with ApplicantStack. Designed for HR professionals and recruiters, ApplicantStack helps streamline the recruiting and onboarding processes to improve productivity and reduce costs. ApplicantStack provides a complete toolkit that includes tools for posting, launching, and advertising jobs, assessing and managing candidates, collaborating with teams, centralizing information for quick hiring and onboarding, and more.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of LRSTAR parser generator for C++!