Ordered attributed grammars

Kastens, Uwe

doi:10.1007/bf00288644

Cited by 212 publications

(63 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It only evaluates changed attributes and propagates evaluation to affected attributes. A similar incremental evaluation algorithm is shown in [31,32] for ordered attributed grammars [13]. In [22,24,23,12], extensions to propagation are shown that stop propagation if an attribute value is unchanged from its previous attribution.…”

Section: Related Workmentioning

confidence: 99%

A Language Independent Task Engine for Incremental Name and Type Analysis

Wachsmuth

Konat

Vergu

et al. 2013

Software Language Engineering

View full text Add to dashboard Cite

Abstract. IDEs depend on incremental name and type analysis for responsive feedback for large projects. In this paper, we present a languageindependent approach for incremental name and type analysis. Analysis consists of two phases. The first phase analyzes lexical scopes and binding instances and creates deferred analysis tasks. A task captures a single name resolution or type analysis step. Tasks might depend on other tasks and are evaluated in the second phase. Incrementality is supported on file and task level. When a file changes, only this file is recollected and only those tasks are reevaluated, which are affected by the changes in the collected data. The analysis does neither re-parse nor re-traverse unchanged files, even if they are affected by changes in other files. We implemented the approach as part of the Spoofax Language Workbench and evaluated it for the WebDSL web programming language.

show abstract

Section: Related Workmentioning

confidence: 99%

A Language Independent Task Engine for Incremental Name and Type Analysis

Wachsmuth

Konat

Vergu

et al. 2013

Software Language Engineering

View full text Add to dashboard Cite

show abstract

“…Efficient evaluators can automatically be computed from AG definitions for ordered AGs (Kastens 1980). In Ordered Attribute Grammars (OAGs) the dependencies between attributes are used to statically find an evaluation order such that for all possible ASTs the attribute values of the dependencies of an attribute are computed before the attribute itself is computed.…”

Section: Attribute Grammarsmentioning

confidence: 99%

Lazy stateless incremental evaluation machinery for attribute grammars

Bransen

Dijkstra

Swierstra

2014

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

Many computer programs work with data that changes over time.Computations done over such data usually are repeated completely after a change in the data. For complex computations such repetitive recomputation can become too inefficient. When these recomputations take place on data which has only changed slightly, it often is possible to reformulate the computation to an incremental version which reuses the result of the computation on previous data. Such a situation typically occurs in compilers and editors for structured data (like a program) where program analyses and transformations (for example error checking) are done while editing.Although rewriting to incremental versions thus offers a solution to this problem, a manual rewrite of an already complex computation to its incremental counterpart is tedious, error prone, and inhibits further development of the original computation. We therefore intend to generate such incremental counterparts (semi)automatically by focusing on computations expressed using Attribute Grammars (AGs).In this paper we do groundwork for this goal and develop machinery for incremental attribute grammar evaluation based on change propagation and pure functions. We use pretty printing with free variable annotation to explain our techniques. Furthermore, our techniques also expose rules of conduct for a programmer desiring incrementality: the automatic translation of code to an incremental version does not always directly result in efficiency improvements because code often is written in a style unsuitable for automatic incrementalization. We show some common cases in which (small) code changes facilitating incrementality are required. We evaluate the effectiveness of the overall approach using a simple benchmark for the example, and a more extensive benchmark based on constraint-based type inference implemented with AGs.

show abstract

“…A number of different evaluation algorithms were developed, for full Knuth-style AGs as well as for subclasses thereof. One of the most influential subclasses is Kastens' ordered attribute grammars (OAGs) [Kas80]. OAGs are powerful enough for the implementation of full programming languages, yet allow the generation of efficient static attribute evaluators.…”

Section: Brief Historical Notesmentioning

confidence: 99%

An Introductory Tutorial on JastAdd Attribute Grammars

Hedin

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.JastAdd is an open-source system for generating compilers and other language-based tools. Its declarative specification language is based on reference attribute grammars and object-orientation. This allows tools to be implemented as composable extensible modules, as exemplified by JastAddJ, a complete extensible Java compiler. This tutorial gives an introduction to JastAdd and its core attribute grammar mechanisms, and how to use them when solving key problems in building language-based tools. A simple state machine language is used as a running example, showing the essence of name analysis, adding graphs to the abstract syntax tree, and computing circular properties like reachability. Exercises are included, and code for the examples is available online.

show abstract

Ordered attributed grammars

Cited by 212 publications

References 9 publications

A Language Independent Task Engine for Incremental Name and Type Analysis

A Language Independent Task Engine for Incremental Name and Type Analysis

Lazy stateless incremental evaluation machinery for attribute grammars

An Introductory Tutorial on JastAdd Attribute Grammars

Contact Info

Product

Resources

About