Incremental Evaluation of Higher Order Attributes

Abstract

Compilers, amongst other programs, often work with data that (slowly) changes over time. When the changes between subsequent runs of the compiler are small, one would hope the compiler to incrementally update its results, resulting in much lower running times. However, the manual construction of an incremental compiler is very hard and error prone and therefore usually not an option.Attribute grammars provide an attractive way of constructing compilers, as they are compositional in nature and allow for aspect oriented programming. In this work we extend previous work on the automatic generation of incremental attribute grammar evaluators, with the purpose of (semi-)automatically generating an incremental compiler from the regular attribute grammar definition, by adding support for incremental evaluation of higher order attributes, a well known extension to the classical attribute grammars that is used in many ways in compiler construction, for example to model different compiler phases.

We should Stop Claiming Generality in our Domain-Specific Language Papers

“…Moreover, when research branches out, the running examples do not work in other branches. For example, classical attribute grammars [14,23,24] are extended in aggregate AGs [9], remote AGs [1], reference AGs (RAGs) [17], and various higherorder AGs [18,20,15,2,3], but these extensions do not support each others running examples while most authors claim it is a general framework for building compilers. (One such example is that aggregate AGs (1986) [9] optimize edits on map data Figure 1 Trade-off between specificity and generality in name binding DSLs.…”

“…Presented at the LangDevCon in 2018 (http://langdevcon.org/) 2. Presented at the Dutch Software Engineering Symposium in 2016 (http://www.sensymposium.nl/history/2016/program/).18:5We should Stop Claiming Generality in our DSL Papers…”