Incremental generation of parsers

Authors:
J. Heering;P. Klint;J. Rekers
Affiliations:
Department of Software Technology, Centre for Mathematics and Computer Science, P. 0. Box 4079, 1009 AB Amsterdam, The Netherlands;Programming Research Group, University of Amsterdam, P. 0. Box 4 7 882, 1009 DB Amsterdam, The Netherlands;Department of Software Technology, Centre for Mathematics and Computer Science, P. 0. Box 4079, 1009 AB Amsterdam, The Netherlands
Venue:
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Year:
1989

Citing 8
Cited 9

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
CIGALE: A tool for interactive grammar construction and expression parsing

Science of Computer Programming
Algebraic specification

Algebraic specification
Principles of OBJ2

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An efficient context-free parsing algorithm

Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Lithe: a language combining a flexible syntax and classes

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deterministic Techniques for Efficient Non-Deterministic Parsers

Proceedings of the 2nd Colloquium on Automata, Languages and Programming

Incremental Generation of Parsers

IEEE Transactions on Software Engineering
A survey of adaptable grammars

ACM SIGPLAN Notices
INC: a language for incremental computations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Generation and recognition of formal languages by modifiable grammars

ACM SIGPLAN Notices
Substring parsing for arbitrary context-free grammars

ACM SIGPLAN Notices
Incremental generation of lexical scanners

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic parsers and evolving grammars

ACM SIGPLAN Notices
Incremental parser generation for Tree Adjoining Grammars

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Implementation of a prototype for the new ASF+SDF meta-environment

Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An LR-based parser generator for arbitrary context-free grammars is described, which generates parsers by need and processes grammar modifications by updating already existing parsers. We motivate the need for these techniques in the context of interactive language definition environments, present all required algorithms, and give measurements comparing their performance with that of conventional techniques.