Automatic construction of incremental LR(1)—parsers
- 1 March 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 23 (3) , 33-42
- https://doi.org/10.1145/43895.43899
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.Keywords
This publication has 8 references indexed in Scilit:
- The token-oriented approach to program editingACM SIGPLAN Notices, 1985
- An efficient incremental LR parser for grammars with epsilon productionsActa Informatica, 1983
- On the worst case of a minimal spanning tree algorithm for euclidean spaceBIT Numerical Mathematics, 1983
- Building friendly parsersPublished by Association for Computing Machinery (ACM) ,1982
- The design of a language-directed editor for block-structured languagesPublished by Association for Computing Machinery (ACM) ,1981
- Parsing for structural editorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Augmenting Parsers to Support IncrementalityJournal of the ACM, 1980
- Incremental ParsingACM Transactions on Programming Languages and Systems, 1979