Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6469
Title: Sublinear-Space Evaluation Algorithms for Attribute Grammars
Authors: Reps, Thomas
Demers, Alan J.
Keywords: computer science
technical report
Issue Date: Aug-1984
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-630
Abstract: The chief hindrance to the widespread adoption of attribute-grammar-based systems has been that they are profligate consumers of storage. This paper concerns new storage management techniques that reduce the amount of storage used by reducing the number of attribute values retained at any stage of attribute evaluation; it presents one algorithm for evaluating an $n$-attribute tree that never retains more than $O(\sqrt{n})$ attribute values, and it presents a second algorithm that never retains more than $O(\log n)$ attribute values.
URI: http://hdl.handle.net/1813/6469
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
84-630.pdf2.12 MBAdobe PDFView/Open
84-630.ps509.41 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us