A method for incrementally compiling languages with nested statement structure

Authors:
Jay Earley;Paul Caizergues
Affiliations:
Univ. of California, Berkeley, Berkeley;Univ. of California, Berkeley, Berkeley
Venue:
Communications of the ACM
Year:
1972

Citing 4
Cited 6

Toward an understanding of data structures

Communications of the ACM
A formal semantics for computer languages and its application in a compiler-compiler

Communications of the ACM
Syntax macros and extended translation

Communications of the ACM
The SNOBOL4 programming language

The SNOBOL4 programming language

Incremental compilation of optimized code

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Augmenting Parsers to Support Incrementality

Journal of the ACM (JACM)
A systematic approach to advanced debugging through incremental compilation (Preliminary Draft)

SIGSOFT '83 Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging
Interactive incremental chart parsing

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Incremental parsing and reason maintenance

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Symbolic debugging through incremental compilation in an integrated environment

Journal of Systems and Software

Quantified Score

Hi-index	48.22

Visualization

Abstract

A method of incremental compilation is presented which applies especially to programming languages in which statements can be nested (such as Algol and PL/I). The method permits editing of the source language using a general purpose text editor, and incremental processing of changes without frequent recompilation of entire routines. The essential points of the method are: (1) the syntax of the language is restricted insofar as which constructs may occur on lines; (2) an internal data structure (called the skeleton) is maintained to represent the statement structure; (3) the recompilation is partially batched in the sense that recompilation of modified lines does not occur until the last of a set of editing commands has been received; and (4) the parsing and compilation are factored into two parts, that done on individual lines and that done globally to handle the relationships between the lines.