Empirical comparison of LR(k) and precedence parsers

Authors:
J. J. Horning;W. R. Lalonde
Affiliations:
University of Toronto Computer Systems Research Group, Toronto, Canada;University of Toronto Computer Systems Research Group, Toronto, Canada
Venue:
ACM SIGPLAN Notices
Year:
1970

Citing 5
Cited 1

Syntactic Analysis and Operator Precedence

Journal of the ACM (JACM)
Translator writing systems

Communications of the ACM
A practical method for constructing LR (k) processors

Communications of the ACM
Bounded context syntactic analysis

Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM

A parser-generating system for constructing compressed compilers

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

Knuth's LR(k) algorithm provides a more general basis for the syntactic portion of compilers than does precedence analysis. We have conducted experiments to determine, for practical grammars, how much this extra generality costs in efficiency. The results indicate that the extra generality of the LR(k) approach may often be accompanied by a reduction in table size and an increase in parsing speed.