Transformation of Attribute Grammars into Efficient Action Routines by Patch Introduction
Summary :
This paper gives a method for transforming attribute grammars into efficient action routines. An action routine description is a set of fragments of programs associated with production rules. Those fragments of programs are activated according to the ordering given by a bottom-up syntax analyzer. We present a transformation method which we call patch introduction. Patch introduction consists of techniques which we call extended postfix transformation and broadcast type inherited attribute elimination. Extended postfix transformation is an extension of simple postfix transformation. Broadcast type inherited attribute elimination is a technique of making the evaluation into a one-pass bottom-up evaluation. The scenario of patch introduction is as follows. First we reverse the flow of broadoast type inherited attributes, and transform those inherited attributes into synthesized attributes whose values are sets of addresses. Then we introduce generation of incomplete code where code is an extended postfix attribute, and introduce patch operations at the point where values of the broadcast type inherited attributes are determined. We illustrate the usefulness of our patch introduction method using a problem of translation of Boolean expressions into an intermediate code of short-circuit evaluation form.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E69-E No.9 pp.980-987
- Publication Date
- 1986/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Automata and Languages
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takehiro TOKUDA, "Transformation of Attribute Grammars into Efficient Action Routines by Patch Introduction" in IEICE TRANSACTIONS on transactions,
vol. E69-E, no. 9, pp. 980-987, September 1986, doi: .
Abstract: This paper gives a method for transforming attribute grammars into efficient action routines. An action routine description is a set of fragments of programs associated with production rules. Those fragments of programs are activated according to the ordering given by a bottom-up syntax analyzer. We present a transformation method which we call patch introduction. Patch introduction consists of techniques which we call extended postfix transformation and broadcast type inherited attribute elimination. Extended postfix transformation is an extension of simple postfix transformation. Broadcast type inherited attribute elimination is a technique of making the evaluation into a one-pass bottom-up evaluation. The scenario of patch introduction is as follows. First we reverse the flow of broadoast type inherited attributes, and transform those inherited attributes into synthesized attributes whose values are sets of addresses. Then we introduce generation of incomplete code where code is an extended postfix attribute, and introduce patch operations at the point where values of the broadcast type inherited attributes are determined. We illustrate the usefulness of our patch introduction method using a problem of translation of Boolean expressions into an intermediate code of short-circuit evaluation form.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e69-e_9_980/_p
Copy
@ARTICLE{e69-e_9_980,
author={Takehiro TOKUDA, },
journal={IEICE TRANSACTIONS on transactions},
title={Transformation of Attribute Grammars into Efficient Action Routines by Patch Introduction},
year={1986},
volume={E69-E},
number={9},
pages={980-987},
abstract={This paper gives a method for transforming attribute grammars into efficient action routines. An action routine description is a set of fragments of programs associated with production rules. Those fragments of programs are activated according to the ordering given by a bottom-up syntax analyzer. We present a transformation method which we call patch introduction. Patch introduction consists of techniques which we call extended postfix transformation and broadcast type inherited attribute elimination. Extended postfix transformation is an extension of simple postfix transformation. Broadcast type inherited attribute elimination is a technique of making the evaluation into a one-pass bottom-up evaluation. The scenario of patch introduction is as follows. First we reverse the flow of broadoast type inherited attributes, and transform those inherited attributes into synthesized attributes whose values are sets of addresses. Then we introduce generation of incomplete code where code is an extended postfix attribute, and introduce patch operations at the point where values of the broadcast type inherited attributes are determined. We illustrate the usefulness of our patch introduction method using a problem of translation of Boolean expressions into an intermediate code of short-circuit evaluation form.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Transformation of Attribute Grammars into Efficient Action Routines by Patch Introduction
T2 - IEICE TRANSACTIONS on transactions
SP - 980
EP - 987
AU - Takehiro TOKUDA
PY - 1986
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E69-E
IS - 9
JA - IEICE TRANSACTIONS on transactions
Y1 - September 1986
AB - This paper gives a method for transforming attribute grammars into efficient action routines. An action routine description is a set of fragments of programs associated with production rules. Those fragments of programs are activated according to the ordering given by a bottom-up syntax analyzer. We present a transformation method which we call patch introduction. Patch introduction consists of techniques which we call extended postfix transformation and broadcast type inherited attribute elimination. Extended postfix transformation is an extension of simple postfix transformation. Broadcast type inherited attribute elimination is a technique of making the evaluation into a one-pass bottom-up evaluation. The scenario of patch introduction is as follows. First we reverse the flow of broadoast type inherited attributes, and transform those inherited attributes into synthesized attributes whose values are sets of addresses. Then we introduce generation of incomplete code where code is an extended postfix attribute, and introduce patch operations at the point where values of the broadcast type inherited attributes are determined. We illustrate the usefulness of our patch introduction method using a problem of translation of Boolean expressions into an intermediate code of short-circuit evaluation form.
ER -
English
