Definition and Use of Attribute Reevaluation in Attributed Grammars
| dc.contributor.author | Skedzeleski, Stephen K. | en_US |
| dc.date.accessioned | 2012-03-15T16:29:14Z | |
| dc.date.available | 2012-03-15T16:29:14Z | |
| dc.date.created | 1978 | en_US |
| dc.date.issued | 1978 | |
| dc.description.abstract | Attributed grammars can be used to specify both the syntax and the semantics of programming languages, and provide an implementation for compilers. We discuss extensions to attributed grammars and a generalization of attribute evaluation that allow code optimization techniques to be efficiently implemented and easily specified. A formal definition of the extended attributed grammars, called time-varying attributed grammars, is given. Time-varying attributed grammars provide a high-level, non-procedural specification of iterative algorithms. Evaluators for time-varying attributed grammars are described and potential problems that can result from the use are discussed. Examples of common code optimization techniques are given using time-varying attributed grammars. Techniques that reduce the overhead of evaluation, and also simplify the specifications of attributed grammars are suggested. | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.citation | TR340 | |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/58122 | |
| dc.publisher | University of Wisconsin-Madison Department of Computer Sciences | en_US |
| dc.title | Definition and Use of Attribute Reevaluation in Attributed Grammars | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1