Premium
Very fast YACC‐compatible parsers (for very little effort)
Author(s) -
Bhamidipaty A.,
Proebsting T. A.
Publication year - 1998
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(199802)28:2<181::aid-spe139>3.0.co;2-4
Subject(s) - computer science , parsing , lr parser , programming language , executable , generator (circuit theory) , parser combinator , power (physics) , physics , quantum mechanics
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; yacc produces interpreted, table‐driven parsers. Two attributes distinguish mule from other parser generators that create hard‐coded LR parsers; mule is compatible wtih yacc (including yacc's 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. © 1998 John Wiley & Sons, Ltd.