Compiler Optimization: A Case for the Transformation Tool Contest

Abstract

An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of operations supported by the target hardware. In modern compiler construction graph-based IRs are employed. Optimization and lowering tasks can then be implemented with graph transformation rules. This case provides two compiler tasks to evaluate the participating tools regarding performance.

In Proceedings TTC 2011, arXiv:1111.4407

References in corpus (1)

• Solving the TTC 2011 Compiler Optimization Case with GrGen.NET

Cited by in corpus (6)

• Solving the TTC 2011 Compiler Optimization Case with GReTL
• Solving the TTC 2011 Compiler Optimization Case with GrGen.NET
• Solving the TTC 2011 Compiler Optimization Case with QVTR-XSLT
• Solving the TTC 2011 Compiler Optimization Task with metatools
• Solving the TTC 2011 Compiler Optimization Case with GROOVE
• Saying Hello World with GReTL - A Solution to the TTC 2011 Instructive Case