Automatic construction of incremental LR(1)—parsers

Authors:
Dashing Yeh;Uwe Kastens
Affiliations:
Tongji University, Shanghai, P.R. China;University of Paderborn, Paderborn, FRG
Venue:
ACM SIGPLAN Notices
Year:
1988

Citing 7
Cited 3

An efficient incremental LR parser for grammars with epislon productions

Acta Informatica
Augmenting Parsers to Support Incrementality

Journal of the ACM (JACM)
Incremental Parsing

ACM Transactions on Programming Languages and Systems (TOPLAS)
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Building friendly parsers

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The design of a language-directed editor for block-structured languages

Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
The token-oriented approach to program editing

ACM SIGPLAN Notices

Improvements of an incremental evaluation algorithm for ordered attribute grammars

ACM SIGPLAN Notices
Optimal incremental parsing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient and flexible incremental parsing

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An effective method is presented for automatic construction of incremental LR(1) parsers. The resulting parsers allow multiple modifications of the original input as well as epsilon productions in the underlying LR(1) grammar. For parsing a modified input, their space require ment depends linear on the length of the input and their runtime is proportional to the total size of the modifications. The method has been implemented for experimental purposes.