|
ABSTRACT
The ability to generate language-based editors depends on the existence of a powerful, language-independent model of editing. A model is proposed in which programs are represented as attributed abstract-syntax trees with an associated relational database. Relations can depend on the state of the attributed tree, and attributes can depend on the values in relations, provided there are no circular dependencies.
The power and the limitations of relational operations are demonstrated with respect to the support of static-semantic checking, anomaly detection, an interrogation facility, and the ability to define alternative program displays. The advantages of the hybrid system over both the purely relational and purely attribute-based systems are presented, and new algorithms are given for query evaluation and incremental view updating motivated by the efficiency requirements of interactive editing under the defined model. A prototype implementation of an editor generator is described, and suggestions for future research are made.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
 |
3
|
|
| |
4
|
|
 |
5
|
|
 |
6
|
Alan Demers , Anne Rogers , Frank Kenneth Zadeck, Attribute propagation by message passing, Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments, p.43-59, June 25-28, 1985, Seattle, Washington, United States
|
| |
7
|
DONZEAU-GOuGE, V., HUET, G., KAHN, G., AND LANG, B. Programming environments based on structured editors: The MENTOR experience. INRIA Rapports de Recherche 26 (July 1980).
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
JOU~SON, G. An approach to incremental semantics. Ph.D. thesis, Univ. of Wisconsin- Madison, 1983.
|
| |
12
|
KASTENS, U. Ordered attribute grammars. Acta Inf. 13, 3 (1980), 229-256.
|
| |
13
|
KNUTH, D. E. Semantics of context-free languages. Math. Syst. Theor. 2, 2 (June 1968), 127-145.
|
| |
14
|
KNUTH, D.E. Correction. Math. Syst. Theor. 5, i (Mar. 1971), 95-96.
|
| |
15
|
KOENIG, S., AND PAIGE, R. A transformational framework for the automatic control of derived data. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes, France, Sept. 1981), 306-318.
|
 |
16
|
|
| |
17
|
|
| |
18
|
OSTERWEIL, L. J., AND FOSDICK, L.D. DAVE--A validation error detection and documentation system for FORTRAN programs. Softw. Pract. Exper. 6 (1976), 473-486.
|
| |
19
|
RAIHA, K., AND SAARINEN, J. Testing attribute grammars for circularity. Acta Inf. 17, 2 (June 1982), 185-192.
|
 |
20
|
|
| |
21
|
|
 |
22
|
|
 |
23
|
|
 |
24
|
|
 |
25
|
|
 |
26
|
|
| |
27
|
|
CITED BY 28
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Discovering auxiliary information for incremental computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-170, January 21-24, 1996, St. Petersburg Beach, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Gerald David Chandler : Reviewer"
A hybrid basis for the implementation of Language-Based Editors (LBEs), called
relationally attributed grammars>, is introduced in this paper. Information
about the state of a source program is kept as a combination of attributes to
a
more...
|