JavaScript is disabled for your browser. Some features of this site may not work without it.
Optimal-Time Incremental Semantic Analysis for Syntax-Directed Editors
dc.contributor.author | Reps, Thomas | en_US |
dc.date.accessioned | 2007-04-23T16:41:22Z | |
dc.date.available | 2007-04-23T16:41:22Z | |
dc.date.issued | 1981-03 | en_US |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR81-453 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6293 | |
dc.description.abstract | Attribute grammars permit the specification of static semantics in an applicative and modular fashion, and thus are a good basis for syntax-directed editors. Such editors represent programs as as attributed trees, which are modified by operations such as subtree pruning and grafting. After each modification, a subset of attributes, AFFECTED, requires new values. Membership in AFFECTED is not known a priori; this paper presents an algorithm that identifies attributes in AFFECTED and recomputes their values. The algorithm is time-optimal, its cost is proportional to the size of AFFECTED. | en_US |
dc.format.extent | 1696956 bytes | |
dc.format.extent | 451316 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | Optimal-Time Incremental Semantic Analysis for Syntax-Directed Editors | en_US |
dc.type | technical report | en_US |