|
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
|
ASBROCK, B. Attribut-Implementierung und -Optimierung f/Jr Attribute Grammatiken. Diplomarbeit, Fakult/it ftir Informatik, Universit/it Karlsruhe, Karlsruhe, West Germany, July 1979.
|
| |
2
|
BAmCH, W.A., AND JAZAYERI, M. The method of attributes for data flow analysis, parts I and II. Acta Inf. 10 (1978), 245-272.
|
 |
3
|
|
 |
4
|
|
 |
5
|
Harald Ganzinger , Knut Ripken , Reinhard Wilhelm, MUG1 - an incremental compiler-compiler, Proceedings of the annual conference, p.415-418, October 20-22, 1976, Houston, Texas, United States
[doi> 10.1145/800191.805629]
|
| |
6
|
|
 |
7
|
|
| |
8
|
JAZAYERI, M., AND POZEFSKY, D. Algorithms for efficient evaluation of multi-pass attribute grammars without a parse tree. Tech. Rep. TR77-001, Department of Computer Science, Univ. of North Carolina, Chapel Hill, N.C., May 1974.
|
| |
9
|
KASTENS, U. Ordered attribute grammars. Acta Inf. 13 (1980), 229-256.
|
| |
10
|
KASTENS, U., AND ZIMMERMANN, E. GAG-A generator based on attributed grammar. Bericht Nr. 14/80, Institute fiir Informatik II, Universitfit Karlsruhe, Karlsruhe, West Germany.
|
| |
11
|
|
 |
12
|
|
 |
13
|
|
| |
14
|
KNUTH, D.E. Examples o{ Formal Semantics. Lecture Notes in Mathematics, vol. 188. Springer- Verlag, New York, 1971.
|
| |
15
|
KNUTH, D.E. Semantics of context-free languages. Math. Syst. Theory J.2 (1968), 127-145.
|
| |
16
|
KNUTH, D.E. Semantics of context-free languages: Correction. Math. Syst. Theory J.5 (1971), 95.
|
| |
17
|
LEWIS, P.M., ROSENKRANTZ, D.J., AND STEARNS, R.E. Attributed translations. J. Comput. Syst. Sck 9 (1974), 279-307.
|
| |
18
|
MADSEN, O.L. On defining semantics by means of extended attribute grammars. Rep. DAIMI PB-109, Computer Science Department, Aarhus Univ., Aarhus, Denmark, Jan. 1980.
|
| |
19
|
POZEFSK~, D. Building efficient pass-oriented attribute grammar evaluators. Tech. Rep. TR 79-006, Dept. of Computer Science, Univ. of North Carolina, Chapel Hill, N.C., 1979.
|
| |
20
|
RAinS, K.J., SAARINEN, M., $OiSALON-$OiNINEN, E., AND TIENARI, M. The compiler writing system HLP. Rep. A-1978-2, Dept. of Computer Science, Univ. of Helsinki, Helsinki, Finland, Mar. 1978.
|
| |
21
|
|
CITED BY 16
|
|
|
|
|
|
|
|
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
"Jan Messerschmidt : Reviewer"
When considering the evaluation of attributes in an attribute grammar, two
approaches are possible. The first one, known as the Kennedy and Warren
approach [1], uses automata attached to every node in the abstract syntax tree.
These automata con
more...
|