Decorated attribute grammars: attribute evaluation meets strategic programming

Lennart C L Kats; Anthony M. Sloane; Eelco Visser

doi:10.1007/978-3-642-00722-4_11

Decorated attribute grammars: attribute evaluation meets strategic programming

Lennart C L Kats, Anthony M. Sloane, Eelco Visser

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

25 Citations (Scopus)

Abstract

Attribute grammars are a powerful specification formalism for tree-based computation, particularly for software language processing. Various extensions have been proposed to abstract over common patterns in attribute grammar specifications. These include various forms of copy rules to support non-local dependencies, collection attributes, and expressing dependencies that are evaluated to a fixed point. Rather than implementing extensions natively in an attribute evaluator, we propose attribute decorators that describe an abstract evaluation mechanism for attributes, making it possible to provide such extensions as part of a library of decorators. Inspired by strategic programming, decorators are specified using generic traversal operators. To demonstrate their effectiveness, we describe how to employ decorators in name, type, and flow analysis.

Original language	English
Title of host publication	Compiler Construction
Subtitle of host publication	18th International Conference, CC 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings
Editors	Oege de Moor, Michael I. Schwartzbach
Place of Publication	Berlin
Publisher	Springer, Springer Nature
Pages	142-157
Number of pages	16
ISBN (Electronic)	9783642007224
ISBN (Print)	9783642007217
DOIs	https://doi.org/10.1007/978-3-642-00722-4_11
Publication status	Published - 2009
Event	18th International Conference on Compiler Construction, CC 2009. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009 - York, United Kingdom Duration: 22 Mar 2009 → 29 Mar 2009

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	5501
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	18th International Conference on Compiler Construction, CC 2009. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Country/Territory	United Kingdom
City	York
Period	22/03/09 → 29/03/09

Access to Document

10.1007/978-3-642-00722-4_11

Cite this

Kats, L. C. L., Sloane, A. M., & Visser, E. (2009). Decorated attribute grammars: attribute evaluation meets strategic programming. In O. de Moor, & M. I. Schwartzbach (Eds.), Compiler Construction: 18th International Conference, CC 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings (pp. 142-157). (Lecture Notes in Computer Science; Vol. 5501). Springer, Springer Nature. https://doi.org/10.1007/978-3-642-00722-4_11

Kats, Lennart C L ; Sloane, Anthony M. ; Visser, Eelco. / Decorated attribute grammars : attribute evaluation meets strategic programming. Compiler Construction: 18th International Conference, CC 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. editor / Oege de Moor ; Michael I. Schwartzbach. Berlin : Springer, Springer Nature, 2009. pp. 142-157 (Lecture Notes in Computer Science).

@inproceedings{13b9e3eb7b424fb0b90858cfbfdad238,

title = "Decorated attribute grammars: attribute evaluation meets strategic programming",

abstract = "Attribute grammars are a powerful specification formalism for tree-based computation, particularly for software language processing. Various extensions have been proposed to abstract over common patterns in attribute grammar specifications. These include various forms of copy rules to support non-local dependencies, collection attributes, and expressing dependencies that are evaluated to a fixed point. Rather than implementing extensions natively in an attribute evaluator, we propose attribute decorators that describe an abstract evaluation mechanism for attributes, making it possible to provide such extensions as part of a library of decorators. Inspired by strategic programming, decorators are specified using generic traversal operators. To demonstrate their effectiveness, we describe how to employ decorators in name, type, and flow analysis.",

author = "Kats, {Lennart C L} and Sloane, {Anthony M.} and Eelco Visser",

year = "2009",

doi = "10.1007/978-3-642-00722-4_11",

language = "English",

isbn = "9783642007217",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Springer Nature",

pages = "142--157",

editor = "{de Moor}, Oege and Schwartzbach, {Michael I.}",

booktitle = "Compiler Construction",

address = "United States",

note = "18th International Conference on Compiler Construction, CC 2009. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009 ; Conference date: 22-03-2009 Through 29-03-2009",

}

Kats, LCL, Sloane, AM & Visser, E 2009, Decorated attribute grammars: attribute evaluation meets strategic programming. in O de Moor & MI Schwartzbach (eds), Compiler Construction: 18th International Conference, CC 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. Lecture Notes in Computer Science, vol. 5501, Springer, Springer Nature, Berlin, pp. 142-157, 18th International Conference on Compiler Construction, CC 2009. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, United Kingdom, 22/03/09. https://doi.org/10.1007/978-3-642-00722-4_11

Decorated attribute grammars: attribute evaluation meets strategic programming. / Kats, Lennart C L; Sloane, Anthony M.; Visser, Eelco.
Compiler Construction: 18th International Conference, CC 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. ed. / Oege de Moor; Michael I. Schwartzbach. Berlin: Springer, Springer Nature, 2009. p. 142-157 (Lecture Notes in Computer Science; Vol. 5501).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Decorated attribute grammars

T2 - 18th International Conference on Compiler Construction, CC 2009. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009

AU - Kats, Lennart C L

AU - Sloane, Anthony M.

AU - Visser, Eelco

PY - 2009

Y1 - 2009

N2 - Attribute grammars are a powerful specification formalism for tree-based computation, particularly for software language processing. Various extensions have been proposed to abstract over common patterns in attribute grammar specifications. These include various forms of copy rules to support non-local dependencies, collection attributes, and expressing dependencies that are evaluated to a fixed point. Rather than implementing extensions natively in an attribute evaluator, we propose attribute decorators that describe an abstract evaluation mechanism for attributes, making it possible to provide such extensions as part of a library of decorators. Inspired by strategic programming, decorators are specified using generic traversal operators. To demonstrate their effectiveness, we describe how to employ decorators in name, type, and flow analysis.

AB - Attribute grammars are a powerful specification formalism for tree-based computation, particularly for software language processing. Various extensions have been proposed to abstract over common patterns in attribute grammar specifications. These include various forms of copy rules to support non-local dependencies, collection attributes, and expressing dependencies that are evaluated to a fixed point. Rather than implementing extensions natively in an attribute evaluator, we propose attribute decorators that describe an abstract evaluation mechanism for attributes, making it possible to provide such extensions as part of a library of decorators. Inspired by strategic programming, decorators are specified using generic traversal operators. To demonstrate their effectiveness, we describe how to employ decorators in name, type, and flow analysis.

UR - http://www.scopus.com/inward/record.url?scp=70350666814&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00722-4_11

DO - 10.1007/978-3-642-00722-4_11

M3 - Conference proceeding contribution

AN - SCOPUS:70350666814

SN - 9783642007217

T3 - Lecture Notes in Computer Science

SP - 142

EP - 157

BT - Compiler Construction

A2 - de Moor, Oege

A2 - Schwartzbach, Michael I.

PB - Springer, Springer Nature

CY - Berlin

Y2 - 22 March 2009 through 29 March 2009

ER -

Kats LCL, Sloane AM, Visser E. Decorated attribute grammars: attribute evaluation meets strategic programming. In de Moor O, Schwartzbach MI, editors, Compiler Construction: 18th International Conference, CC 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. Berlin: Springer, Springer Nature. 2009. p. 142-157. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-00722-4_11

Decorated attribute grammars: attribute evaluation meets strategic programming

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this