TY - JOUR
AU - Pager, David
AB -  THE LANETRACING ALGORITHM F R CONSTRUCTING LR(k) PARSERS O David Pager, University of Hawaiif ABSTRACT. The paper presents, as far as the author is aware, the f i r s t practical general method for constructing LR(k) parsers. I t has been used, without computational d i f f i c u l t y , to produce LR(1), LR(2) and LR(3) parsers for grammars of the size of ALGOL. INTRODUCTION. LR(k) parsers have attracted a l o t of attention recently [1,2,4-9,11-18] as the most e f f i c i e n t method of parsing a wide subset of the context-free languages which includes most practical languages such as ALGOL and FORTRAN. The parsers produced for such languages using the original parser construction algorithm (Knuth [7]) were very large, so much of the research in the area in the last few years has concentrated on methods for reducing this size. The approach to parser construction introduced by De Remer [4,5] is to employ an LR(O) algorithm even for non-LR(O) grammars, and then attempt to modify the parser produced so as to make i t adequate. De Remer offers a practical method for effecting such a 
TI - The lane tracing algorithm for constructing LR(k) parsers
DA - 1973-04-30
UR - https://www.deepdyve.com/lp/association-for-computing-machinery/the-lane-tracing-algorithm-for-constructing-lr-k-parsers-O38PRJ5Csf
DP - DeepDyve
ER -