Conditional evaluation in simple multi-visit attribute-grammar evaluators

Wuu Yang

doi:10.1109/APSEC.1997.640202

Conditional evaluation in simple multi-visit attribute-grammar evaluators

Wuu Yang^*

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

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 language	English
Pages	455-464
Number of pages	10
DOIs	https://doi.org/10.1109/APSEC.1997.640202
State	Published - 5 Dec 1997
Event	Proceedings 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 1997 → 5 Dec 1997

Conference

Conference	Proceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97
City	Hong Kong, Hong Kong
Period	2/12/97 → 5/12/97

Access to Document

10.1109/APSEC.1997.640202

Cite this

@conference{f66c7bb5ed5341daae8ccc95c314b305,

title = "Conditional evaluation in simple multi-visit attribute-grammar evaluators",

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.",

author = "Wuu Yang",

year = "1997",

month = dec,

day = "5",

doi = "10.1109/APSEC.1997.640202",

language = "English",

pages = "455--464",

note = "Proceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97 ; Conference date: 02-12-1997 Through 05-12-1997",

}

TY - CONF

T1 - Conditional evaluation in simple multi-visit attribute-grammar evaluators

AU - Yang, Wuu

PY - 1997/12/5

Y1 - 1997/12/5

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0031374450

U2 - 10.1109/APSEC.1997.640202

DO - 10.1109/APSEC.1997.640202

M3 - Paper

AN - SCOPUS:0031374450

SP - 455

EP - 464

T2 - Proceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97

Y2 - 2 December 1997 through 5 December 1997

ER -

Conditional evaluation in simple multi-visit attribute-grammar evaluators

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this