ACM Home Page
Please provide us with feedback. Feedback
Improvements of an incremental evaluation algorithm for ordered attribute grammars
Full text PdfPdf (337 KB)
Source ACM SIGPLAN Notices archive
Volume 23 ,  Issue 12  (December 1988) table of contents
Pages: 45 - 50  
Year of Publication: 1988
ISSN:0362-1340
Authors
D. Yeh  Tongji Univ., Shanghai, P.R. China
U. Kastens  Univ. of Paderborn, Paderborn, W. Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/57669.57672
What is a DOI?

ABSTRACT

Three improvements are suggested upon an incremental attribute evaluation algorithm proposed by the first author. The resulting algorithm allows multiple subtree replacement and cancels three auxiliary tables required by the previous version.


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
[3] U. Kastens: Ordered attribute grammars, Acta Informatica, Vol. 13 (1980), pp. 229-256.
 
4
[4] U. Kastens, B. Hutt, E. Zimmermann: GAG: a practical compiler generator, LNCS vol. 141, Springer Verlag, 1982.
 
5
[5] D. Knuth: Semantics of context-free languages, Math. Sys. Theory, Vol. 2, No. 2 (Jan. 1968), pp. 127-145.
6
 
7
[7] D. Yeh: On incremental shift-reduce parsing, BIT 23:1 (1983), pp. 36-48.
 
8
[8] D. Yeh: On incremental evaluation of ordered attribute grammars, BIT 23:3 (1983), pp. 308-320.
9