Circular Higher-order Reference Attribute Grammars

Summary, in English

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.

• Författare: Emma Söderberg; Görel Hedin
• Avdelning/ar: Institutionen för datavetenskap; ELLIIT: the Linköping-Lund initiative on IT and mobile communication; eSSENCE: The e-Science Collaboration; Programvaruteknik
• Publiceringsår: 2013
• Språk: Engelska
• Sidor: 302-321
• Publikation/Tidskrift/Serie: Software Language Engineering: Lecture Notes in Computer Science
• Volym: 8225
• Länkar: http://dx.doi.org/10.1007/978-3-319-02654-1_17
• Dokumenttyp: Konferensbidrag
• Förlag: Springer
• Ämne: Computer Science
• Conference name: 6th International Conference on Software Language Engineering (SLE'13)
• Conference date: 2013-10-27
• Conference place: Indianapolis, Indiana, United States
• Status: Published
• Projekt: ELLIIT LU P05: Scalable Language Tools for Cyber-Physical Systems
• ISBN/ISSN/Övrigt: ISSN: 0302-9743; ISSN: 1611-3349; ISBN: 978-3-319-02653-4