YANG, W. 1994. Incremental LR parsing. In 1994 International Computer Symposium Conference Proceedings vol. 1. National Chiao Tung University, Hsinchu, Taiwan, 577--583.  Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Efficient and Flexible Incremental Parsing - Wagner, Graham (1996) (1 citation) (Correct)
....the grammar to be in LR(k) RL(h) for incremental behavior. Grammars outside this class require batch parsing to the right of the first edit in each region (as defined by a matching condition similar to Larchev eque) Node reuse is a subset of that discovered by Larchev eque s algorithm. Yang [1994] recognizes the utility of sentential form parsing, but still records parse states in nodes and thus requires a post pass to relabel subtrees. Li [1995b] describes a sentential form parser, but his algorithm can generate incorrect parse errors on grammars with ffl rules. It is also limited to ....
YANG, W. 1994. Incremental LR parsing. In 1994 International Computer Symposium Conference Proceedings vol. 1. National Chiao Tung University, Hsinchu, Taiwan, 577--583.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC