ACM Home Page
Please provide us with feedback. Feedback
Incremental attribute evaluation: a flexible algorithm for lazy update
Full text PdfPdf (1.67 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 13 ,  Issue 3  (July 1991) table of contents
Pages: 315 - 341  
Year of Publication: 1991
ISSN:0164-0925
Author
Scott E. Hudson  Univ. of Arizona, Tucson
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 54,   Citation Count: 23
Additional Information:

references   cited by   index terms   collaborative colleagues  

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

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
ALPERN, B., CARLE, A., ROSEN, B., SWEENEY, 1~ , AND ZADECI~, K. Incremental evaluation of attributed graphs. Res. Rep. RC 13205, IBM Corp., Armonk, N Y., Oct. 1987.
2
3
 
4
 
5
6
7
 
8
 
9
10
 
11
KASTENS, U. Ordered attribute grammars. Acta Inf. 13 (1980), 229-256
12
 
13
KNUTS, D. E. Semantics of context-free languages. Math. Syst. Theor. J. 2 (aune 1968), 127-145.
14
15
 
16
 
17
18
 
19
YEH, D. On incremental evaluation of ordered attributed grammars. Bit 23 (1983), 308-320.

CITED BY  23