Attribute Grammar System

UUAGC is the Utrecht University Attribute Grammar Compiler It is a preprocessor for Haskell which makes it easy to write catamorphisms (that is, functions that do to any datatype what foldr does to lists). You can define tree walks using the intuitive concepts of inherited and synthesized attributes, while keeping the full expressive power of Haskell.

Download

You can get the latest stable release in the Download page. UUAGC is distributed under the GNU General Public License.

Documentation

• User's manual
• Slides of ICFP course on: Compiler Construction in Haskell
• Paper on the background of UUAGC as presented at the Third School on AdvancedFunctional Programming.
• Some more slides of tutorials from a tutorial given at GPCE 2003 and IPA 2006.
• Future Projects

Examples of projects building on UUAGC

AG system

The font end of the UUAG system has been bootstrapped using the UUAGC system itself. As a consequence the distribution contains both a generated UUAGC system, and the code to generate it from. Just to get you up and running.

Tiger compiler

In order to compare the UUAGC approach with other approaches we have encode a compiler for the Tiger language, as used in Andrew Appel's books on compiler construction, in AG. For a comparison using Stratego, see here.

Pretty Printing Combinators

A long time ago we implemented a collection of pretty printing combinators, in which one could specify alternative layouts. The development of this has been described in the paper mentioned above. A paper describing online pretty printers developed from an UUAG description has been submitted to JFP. A predecessor of this paper can be found in this technical report.

UHC

Our own, home grown Haskell compiler, is completely UUAGC based. For more information see the UHC home page.

-- DoaitseSwierstra - 29 Aug 2009