Show simple item record

dc.contributor.authorBelmonte, Matthewen_US
dc.date.accessioned2007-04-23T17:33:08Z
dc.date.available2007-04-23T17:33:08Z
dc.date.issued1988-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-920en_US
dc.identifier.urihttps://hdl.handle.net/1813/6760
dc.description.abstractEfficient implementations for two optimisations to Knuth's attribute grammar circularity test are described. A new method for eliminating useless visits to productions is introduced. This improves upon a somewhat weaker mechanism introduced previously by Deransart et. al. Data structures and algorithms for graph covering and elimination of redundant unions are discussed and proven correct.en_US
dc.format.extent978471 bytes
dc.format.extent347983 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.titleA Practical Attribute Grammar Circularity Testen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics