DMCA
Incremental context-dependent analysis for language-based editors (1983)
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 90 - 10 self |
BibTeX
@ARTICLE{Reps83incrementalcontext-dependent,
author = {Thomas Reps and Tim Teitelbaum and Alan Demers},
title = {Incremental context-dependent analysis for language-based editors},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1983}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Knowledge of a programming language's grammar allows language-based editors to enforce syntactic correctness at all times during development by restricting editing operations to legitimate modifications ot ~ the program's context-free derivation tree; however, not all language constraints can be enforced in this way because not all features can be described by the context-free formalism. Attribute grammars permit context-dependent language features to be expressed in a modular, declarative fashion and thus are a good basis for specifying language-based editors. Such editors represent programs as attributed trees, Which are modified by operations such as subtree pruning and grafting. Incremental analysis is performed by updating attribute values after every modification. This paper discusses how updating can be carried out and presents several algorithms for the task, including one that is asymptotically optimal in time.
Keyphrases
language-based editor incremental context-dependent analysis attributed tree context-free formalism language constraint syntactic correctness context-dependent language feature declarative fashion present several algorithm subtree pruning context-free derivation tree good basis attribute value incremental analysis programming language
