Solving the TTC 2011 Compiler Optimization Case with GReTL

TL;DR

This paper presents a GReTL-based solution for the TTC 2011 Compiler Optimization case, addressing constant folding, instruction selection, and graph validation with additional test graphs.

Contribution

It introduces a GReTL approach to compiler optimization tasks, including verification and testing, which is a novel application of this graph transformation language.

Findings

Successfully implemented constant folding and instruction selection

Developed a graph verifier for validation

Provided additional test graphs for extension

Abstract

This paper discusses the GReTL solution of the TTC 2011 Compiler Optimization case. The submitted solution covers both the constant folding task and the instruction selection task. The verifier for checking the validity of the graph is also implemented, and some additional test graphs are provided as requested by the extension.