The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Declarative rewriting through circular nonterminal attributes

På svenska

Author

Summary, in English

Reference attribute grammars (RAGs) provide a practical declarative means to implement programming language compilers and other tools. RAGs have previously been extended to support nonterminal attributes (also known as higher-order attributes), circular attributes, and context-dependent declarative rewrites of the abstract syntax tree. In this previous work, interdependencies between these extensions are not considered. In this article, 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 nonterminal attributes, and show how RAG rewrites are equivalent to such attributes.

Publishing year

2015

Language

English

Pages

3-23

Publication/Series

Computer Languages, Systems & Structures

Volume

44

Document type

Journal article

Publisher

Elsevier

Topic

  • Computer Science

Status

Published

Project

  • ELLIIT LU P05: Scalable Language Tools for Cyber-Physical Systems

Research group

  • LUCAS

ISBN/ISSN/Other

  • ISSN: 1477-8424