Abstract
A method is described to augment an ordinary shift-reduce parser into an incremental one. To parse a modified input, the resulting incremental parser requires about 3(n+m) space and runs in time roughly proportional tom, wheren is the length of the original input andm is the size of the modification made.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho and J. D. Ullman,Theory of Parsing, Translation and Compiling. Vol. 1 – 2, Englewood Cliffs, N.J., Prentice Hall (1972–1973).
A. Celentano,Incremental LR parsing. Acta Informatica 10 (1980), 307–321.
R. S. Glanville and L. S. Graham,A new method for compiler code generation. Conference record of the fifth annual ACM symposium on principles of programming languages, January 1978.
C. Ghezzi and D. Mandrioli,Incremental parsing. ACM trans. on Prog. Lang. and Systems, Vol. 1, No. 1 (July 1979), 58–70.
C. Ghezzi and D. Mandrioli,Augmenting parsers to support incrementality, J. ACM, Vol. 27, No. 3 (July 1980), 564–579.
D. S. Yeh,On construction of incremental LR parsers (forthcoming).
D. S. Yeh,On an incremental code generation method based on the Glanville-Graham scheme, (forthcoming).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yeh, D. On incremental shift-reduce parsing. BIT 23, 36–48 (1983). https://doi.org/10.1007/BF01937324
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01937324