Declarative rewriting through circular nonterminal attributes

Research output: Contribution to journalArticlepeer-review

Abstract

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.
Original languageEnglish
Pages (from-to)3-23
JournalComputer Languages, Systems & Structures
Volume44
DOIs
Publication statusPublished - 2015

Subject classification (UKÄ)

  • Computer Sciences

Fingerprint

Dive into the research topics of 'Declarative rewriting through circular nonterminal attributes'. Together they form a unique fingerprint.

Cite this