Abstract
We have developed a yacc-compatible parser generator that creates parsers that are 2.0 to 6.0 times faster than those generated by yacc or bison. Our tool, mule, creates directly-executable, hard-coded parsers in ANSI C; yacc produces interpreted, table-driven parsers. Two attributes distinguish mule from other parser generators that create hard-coded LR parsers: mule is compatible with yacc (including yaccs peculiar error recovery mechanisms), and mule does absolutely none of the complex automata analysis of previous hard-coded-parser generators. Mule creates simple, fast parsers after very little analysis.
Original language | English (US) |
---|---|
Pages (from-to) | 181-190 |
Number of pages | 10 |
Journal | Software - Practice and Experience |
Volume | 28 |
Issue number | 2 |
DOIs | |
State | Published - Feb 1998 |
Keywords
- LR(1)parser
- Optimization
- Parser generator
- State machine
ASJC Scopus subject areas
- Software