J87-1004 algorithm by extending the standard LR parsing algorithm with the idea of a " graph-structured
C92-1055 especially useful for a generalized LR parsing algorithm , in which context-sensitive
C90-2053 described a new parallel generalized LR parsing algorithm which enables us to achieve greater
J87-1004 for programming languages . An LR parsing algorithm is a Copyright 1987 by the Association
E91-1013 ABSTRACT This paper proposes an LR parsing algorithm modified for grammars with feature-based
C90-3042 Section 2 reviews the generalized LR parsing algorithm . Section 3 then describes how
C88-2118 are terminals . The Generalized LR parsing algorithm is a table driven shift-reduce
C90-3042 Tomita modified the generalized LR parsing algorithm ( GLR ) \ -LSB- 8 \ -RSB- to
C86-1149 algorithm can be viewed as an extended LR parsing algorithm \ -LSB- t \ -RSB- . We compile
J87-1004 The algorithm is a generalized LR parsing algorithm , which precomputes an LR shift-reduce
J87-1004 can be viewed as a generalized LR parsing algorithm that can handle arbitrary context-free
E91-1013 entries during parsing . 2 The LR Parsing Algorithm The LR parser is an efficient
C90-2053 according to the simple parallel LR parsing algorithm are shown in Figure 7 ( a ) .
J87-1004 CONTEXT-FREE PARSING ALGORITHM The LR parsing algorithms ( Aho and Ullman 1972 , Aho and
C88-2118 sentences . We adopt the generalized LR parsing algorithm , and a certain scoring scheme
C88-2138 go alter a reduce action . The LR parsing algorithm pushes state numbers ( as well
C88-2118 do not describe the Generalized LR parsing algorithm in greater detail , referring
C90-2053 above . 4 New Parallel Generalized LR Parsing Algorithm q ` he new parallel parsing algorithm
E91-1013 occur , as is the case of the LR parsing algorithm with atomic categories . The
C88-2138 introduced in the Genera/Ized LR Parsing algorithm \ -LSB- 11 , 12 \ -RSB- , to
hide detail