Solving the TTC 2011 Compiler Optimization Case with

The challenge of the Compiler Optimization Case [2] is to perform local optimizations and instruction selection on the graph-based intermediate representation of a compiler. The case is designed to compare participating tools regarding their performance. We tackle this task employing the general purpose graph rewrite system GRGEN.NET (www.grgen.net). 1 What is GrGen.NET? GRGEN.NET is an application domain neutral graph rewrite system, which started as a helper tool for compiler construction. It is well suited for solving this challenge due to its origin, thus our solution can be seen as a reference, even though the origins were left behind a while ago. The feature highlights regarding practical relevance are: Fully Featured Meta Model: GRGEN.NET uses attributed and typed multigraphs with multiple inher-itance on node/edge types. Attributes may be typed with one of several basic types, user defined enums, or generic set, map, and array types. Expressive Rules, Fast Execution: The expressive and easy to learn rule specification language allows straightforward formulation of even complex problems, with an optimized implementation yield-ing high execution speed at modest memory consumption