Circular Higher-order Reference Attribute Grammars
(2013) 6th International Conference on Software Language Engineering (SLE'13) 8225. p.302-321- Abstract
- Abstract in Undetermined
Reference attribute grammars (RAGs) provide a practical declarative means to implement programming language compilers and other tools. RAGs have previously been extended to support both circular attributes and context-dependent declarative rewrites of the abstract syntax tree. In this previous work, dependencies between circular attributes and rewrites are not considered. In this paper, we investigate how these extensions can interact, and still be well defined. We introduce a generalized evaluation algorithm that can handle grammars where circular attributes and rewrites are interdependent. To this end, we introduce circular higher-order attributes, and show how RAG rewrites are a special form of such... (More) - Abstract in Undetermined
Reference attribute grammars (RAGs) provide a practical declarative means to implement programming language compilers and other tools. RAGs have previously been extended to support both circular attributes and context-dependent declarative rewrites of the abstract syntax tree. In this previous work, dependencies between circular attributes and rewrites are not considered. In this paper, we investigate how these extensions can interact, and still be well defined. We introduce a generalized evaluation algorithm that can handle grammars where circular attributes and rewrites are interdependent. To this end, we introduce circular higher-order attributes, and show how RAG rewrites are a special form of such attributes. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3958562
- author
- Söderberg, Emma LU and Hedin, Görel LU
- organization
- publishing date
- 2013
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Software Language Engineering: Lecture Notes in Computer Science
- volume
- 8225
- pages
- 302 - 321
- publisher
- Springer
- conference name
- 6th International Conference on Software Language Engineering (SLE'13)
- conference location
- Indianapolis, Indiana, United States
- conference dates
- 2013-10-27
- external identifiers
-
- scopus:84891299464
- ISSN
- 1611-3349
- 0302-9743
- ISBN
- 978-3-319-02653-4
- DOI
- 10.1007/978-3-319-02654-1_17
- project
- ELLIIT LU P05: Scalable Language Tools for Cyber-Physical Systems
- language
- English
- LU publication?
- yes
- id
- 7545e8cd-2544-4216-849f-25e180be138a (old id 3958562)
- date added to LUP
- 2016-04-01 10:52:10
- date last changed
- 2024-06-17 03:29:00
@inproceedings{7545e8cd-2544-4216-849f-25e180be138a, abstract = {{Abstract in Undetermined<br/>Reference attribute grammars (RAGs) provide a practical declarative means to implement programming language compilers and other tools. RAGs have previously been extended to support both circular attributes and context-dependent declarative rewrites of the abstract syntax tree. In this previous work, dependencies between circular attributes and rewrites are not considered. In this paper, we investigate how these extensions can interact, and still be well defined. We introduce a generalized evaluation algorithm that can handle grammars where circular attributes and rewrites are interdependent. To this end, we introduce circular higher-order attributes, and show how RAG rewrites are a special form of such attributes.}}, author = {{Söderberg, Emma and Hedin, Görel}}, booktitle = {{Software Language Engineering: Lecture Notes in Computer Science}}, isbn = {{978-3-319-02653-4}}, issn = {{1611-3349}}, language = {{eng}}, pages = {{302--321}}, publisher = {{Springer}}, title = {{Circular Higher-order Reference Attribute Grammars}}, url = {{http://dx.doi.org/10.1007/978-3-319-02654-1_17}}, doi = {{10.1007/978-3-319-02654-1_17}}, volume = {{8225}}, year = {{2013}}, }