INTRODUCTION
Downloads
Feedback From Users
PRODUCTS
LRSTAR
DFASTAR
THEORY
Definition Of Terms
Theoretical Information
COMPANY
About Us
Contact and Support
 Donate
|
| LRSTAR Parser Generator 3.0 |
|
- Creates LR parsers of type
|
LALR(k) |
- Creates LR parser tables of type
|
Matrix |
- Creates parser source code in
|
C++ |
- Compiler front-end speed (lines/second)
|
1,190,000 |
|
yes |
|
yes |
- Shows traces for conflicts in your grammar
|
yes |
- Parsers have automatic error recovery
|
no |
- Parsers have a symbol-table builder
|
yes |
- Parsers do AST construction and traversal
|
yes |
|
yes |
|
|
| DFASTAR Lexer Generator 3.0 |
|
- Creates DFA lexers of type
|
Matrix |
- Creates lexer source code in
|
C, C++ |
- Maximum lexer speed (tokens/second)
|
34,620,000 |
- Number of keywords lexer can handle
|
250,000 |
- Build time for DB2 (550 keywords)
|
5 seconds |
|
yes |
- Lexers do keyword recognition
|
yes |
|
no |
|
yes |
|
|
| GRAMMARS |
COMMENTS |
AUTHOR |
DATE |
|
? |
? |
1988 |
|
Early MS Basic |
Paul Mann |
1987 |
|
Incomplete |
Paul Mann |
? |
|
? |
? |
? |
|
Just for fun |
Paul Mann |
? |
|
Complete? |
Ed Dobies |
1988 |
|
Complete & tested |
Paul Mann |
1995 |
|
Complete |
Paul Mann |
1988 |
|
Complete? |
Ed Dobies |
1988 |
|
Small subset |
Paul Mann |
2005 |
|
Complete? |
Taylor Hutt |
1990 |
|
Complete & tested |
Paul Mann |
1998 |
|
Complete? |
Eric Beser |
1989 |
|
Complete? |
Ed Dobies |
1988 |
|
Complete? |
Bill Spees |
1988 |
|
Complete? |
Paul Mann |
1988 |
|
Complete? |
Paul Mann |
1997 |
|
Complete? |
Paul Mann |
1988 |
|
Complete? |
Paul Mann |
1985 |
|
