Show simple item record

dc.contributor.authorReps, Thomasen_US
dc.date.accessioned2007-04-23T16:41:22Z
dc.date.available2007-04-23T16:41:22Z
dc.date.issued1981-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR81-453en_US
dc.identifier.urihttps://hdl.handle.net/1813/6293
dc.description.abstractAttribute 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.extent1696956 bytes
dc.format.extent451316 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOptimal-Time Incremental Semantic Analysis for Syntax-Directed Editorsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics