Augmenting Parsers to Support Incrementality

Abstract

The concept of incremental parsing is briefly introduced and motivated. A general shift-reduce incremental parser is presented and compared with the corresponding conventional parser in terms of speed of analysis and storage requirements. It is then shown that additional speed-up can be obtained in the particular case of LR parsing. It is suggested that the approach can be applied to other parsing algorithms and generalized to the whole compiling or interpreting process. © 1980, ACM. All rights reserved.