Solving the TTC 2011 Compiler Optimization Case with GROOVE

TL;DR

This paper demonstrates how GROOVE can be used to partially solve a compiler optimization case study by automating constant folding steps, showcasing the tool's applicability to graph transformation tasks.

Contribution

It presents a method to adapt input graphs into GROOVE and provides an initial solution for constant folding in compiler optimization, highlighting the potential of graph transformation tools.

Findings

Successfully automated constant folding steps

Adapted case study graphs into GROOVE representation

Partial solution demonstrating GROOVE's applicability

Abstract

This report presents a partial solution to the Compiler Optimization case study 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.