Solving the TTC 2011 Compiler Optimization Case with GROOVE

Abstract

This report presents a partial solution to the Compiler Optimization case study [1] using GROOVE. We explain how the input graphs provided with the case study were adapted into a GROOVE representation and we describe an initial solution for Task 1. This solution allows us to automatically reproduce the steps of the constant folding example given in the case description. We did not solve Task 2. GROOVEGROOVE 1 [2] is a general purpose graph transformation tool set that uses simple labelled graphs. The core functionality of GROOVE is to recursively apply all rules from a predefined set (the graph production system -GPS) to a given start graph, and to all graphs generated by such applications. This results in a state space consisting of the generated graphs. The main component of the GROOVE tool set is the Simulator, a graphical tool that integrates (among others) the functionalities of rule and host graph editing, and of interactive or automatic state space exploration.