Conditional evaluation in simple multi-visit attribute-grammar evaluators

Wuu Yang*

*Corresponding author for this work

Research output: Contribution to conferencePaper

Abstract

Attribute grammars are a formalism for specifying computations on context-free languages. Due to the non-strictness of the if constructs in attribution equations, it is possible to avoid evaluating certain attribute instances in a syntax tree. A dynamic evaluator can easily avoid such useless computations with a demand-driven approach. However, dynamic evaluators are not efficient because they need to keep the attribute dependence graph during evaluation, and they need to decide an evaluation order for each syntax tree. In contrast, a visit-oriented (static) evaluator can carefully re-arrange the evaluation order and still avoid unnecessary computations. We propose such a technique in this paper.

Original languageEnglish
Pages455-464
Number of pages10
DOIs
StatePublished - 1 Dec 1997
EventProceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97 - Hong Kong, Hong Kong
Duration: 2 Dec 19975 Dec 1997

Conference

ConferenceProceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97
CityHong Kong, Hong Kong
Period2/12/975/12/97

Fingerprint Dive into the research topics of 'Conditional evaluation in simple multi-visit attribute-grammar evaluators'. Together they form a unique fingerprint.

  • Cite this

    Yang, W. (1997). Conditional evaluation in simple multi-visit attribute-grammar evaluators. 455-464. Paper presented at Proceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97, Hong Kong, Hong Kong, . https://doi.org/10.1109/APSEC.1997.640202