Empirical comparison of LR(k) and precedence parsers
J. J. Horning, Wilf R. LaLonde · ACM SIGPLAN Notices · 1970
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.