Solving the TTC 2011 Compiler Optimization Case with GReTL
arXiv:1111.4745 · doi:10.4204/EPTCS.74.10
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.
In Proceedings TTC 2011, arXiv:1111.4407