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.
Cite
@article{arxiv.1111.4746,
title = {Solving the TTC 2011 Compiler Optimization Case with GROOVE},
author = {Arend Rensink and Eduardo Zambon},
journal= {arXiv preprint arXiv:1111.4746},
year = {2011}
}