A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Linearly Ordered Attribute Grammars
2015
Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation - PEPM '15
Attribute Grammars (AGs) extend Context-Free Grammars with attributes: information gathered on the syntax tree that adds semantics to the syntax. AGs are very well suited for describing static analyses, code-generation and other phases incorporated in a compiler. AGs are divided into classes based on the nature of the dependencies between the attributes. In this paper we examine the class of Linearly Ordered Attribute Grammars (LOAGs), for which strict, bounded size evaluators can be generated.
doi:10.1145/2678015.2682543
dblp:conf/pepm/BinsbergenBD15
fatcat:dqpebc75yzfe5egat3qs6nlzpu