A Practical Attribute Grammar Circularity Test
| dc.contributor.author | Belmonte, Matthew | en_US |
| dc.date.accessioned | 2007-04-23T17:33:08Z | |
| dc.date.available | 2007-04-23T17:33:08Z | |
| dc.date.issued | 1988-06 | en_US |
| dc.description.abstract | Efficient 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.extent | 978471 bytes | |
| dc.format.extent | 347983 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-920 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6760 | |
| 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 | A Practical Attribute Grammar Circularity Test | en_US |
| dc.type | technical report | en_US |