|
LRSTAR is an LALR parser generator which creates very-fast parsers in C/C++, 2 times the speed of YACC
parsers, by utilizing compressed-matrix
parser tables^, shift-reduce actions and chain-reduction eliminations.
Performance tests show the parsers can process computer languages at a speed of 500,000 lines per second or more.
LRSTAR reads TBNF grammar notation^,
which is very powerful for defining compiler front-ends. LRSTAR comes with the DFASTAR lexer generator and
compiler front-end source code in C/C++, which does input and output processing, symbol-table creation, AST
construction and AST traversal. There is also a syntax-analyzer in the parsers which tells the user of
your compiler what symbols were expected at the error point. LRSTAR is a Windows 32-bit program and works
well with Microsoft Visual
C++ 2008^. [ Learn more ]
 Download LRSTAR 1.0.372 for Windows
(Includes DFASTAR)
A Translational BNF Grammar Notation (revised)
(Included in LRSTAR download)
TBNF User's Manual 0.2
(Included in LRSTAR download)
Definition Of Terms
(Included in LRSTAR download)
DFASTAR is a DFA lexer generator or regular-expression compiler which creates very-fast lexers in C/C++, 2 times
the speed of FLEX lexical analyzers, by utilizing compressed-matrix lexer tables.
Performance tests show the lexers can process computer languages at a rate of 30,000,000 tokens/second or more.
DFASTAR can generate lexers for 250,000-word dictionaries which greatly exceeds the 4,000-word limit of direct-code
lexers (a compiler limitation).
DFASTAR reads LBNF grammar notation, an improvement over regular expressions. DFASTAR is a Windows 32-bit program
and works well with Microsoft Visual
C++ 2008^. [ Learn more ]
Download DFASTAR 1.0.372 for Windows
BNF Grammars
| GRAMMAR |
COMMENTS |
AUTHOR |
DATE |
| Ada |
? |
? |
1988 |
| Basic |
Early MS Basic |
Paul B Mann |
1987 |
| C |
Incomplete |
Paul B Mann |
? |
| C++ |
Not sure about this one |
? |
? |
| Calc |
Just for fun |
Paul B Mann |
? |
| CICS |
Complete? |
Ed Dobies |
1888 |
| Cobol 85 |
Complete and tested |
Paul B Mann |
1995 |
| dBase III |
Complete |
Paul B Mann |
1988 |
| Fortran 77 |
Complete? |
Ed Dobies |
1988 |
| HTML |
Just a small subset |
Paul B Mann |
2005 |
| Modula2 |
Complete? |
Taylor Hutt |
1990 |
| NCSA logfile |
Complete and tested |
Paul B Mann |
1998 |
| Pascal |
Complete? |
Eric Beser |
1989 |
| PL/1 |
Complete? |
Ed Dobies |
1988 |
| PLM |
Complete? |
Bill Spees |
1988 |
| SQL |
Complete? |
Paul B Mann |
1988 |
| Visual Basic |
Complete? |
Paul B Mann |
1997 |
| XPL |
Complete? |
Paul B Mann |
1988 |
| Zeus |
Complete? |
Paul B Mann |
1985 |
|
