TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator

Authors:
John Boyland;Daniel Spiewak
Affiliations:
Department of EE & Computer Science, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin, USA;Department of EE & Computer Science, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 8
Cited 0

Very fast LR parsing

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Recursive ascent: an LR analog to recursive descent

ACM SIGPLAN Notices
On a recursive ascent parser

Information Processing Letters
Recursive ascent-descent parsing

Computer Languages
Very fast YACC-compatible parsers (for very little effort)

Software—Practice & Experience
Cool: a portable project for teaching compiler construction

ACM SIGPLAN Notices
Generalized left corner parsing

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Non-deterministic recursive ascent parsing

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

ScalaBison is a parser generator accepting bison syntax and generating a parser in Scala. The generated parser uses the idea of ''recursive ascent-descent parsing,'' that is, directly encoded generalized left-corner parsing. Of interest is that fact that the parser is generated from the LALR(1) tables created by bison, thus enabling extensions such as precedence to be handled implicitly.