Solving the TTC 2011 Compiler Optimization Case with GrGen.NET
Sebastian Buchwald (Karlsruhe Institute of Technology (KIT)), Edgar, Jakumeit (Karlsruhe Institute of Technology (KIT))
TL;DR
This paper demonstrates how GrGen.NET, a general-purpose graph rewrite system, can be used to solve compiler optimization problems involving local optimizations and instruction selection on graph-based intermediate representations.
Contribution
It introduces the application of GrGen.NET to the TTC 2011 compiler optimization challenge, showcasing its effectiveness for this task.
Findings
Successfully applied GrGen.NET to the compiler optimization case
Achieved competitive performance in local optimizations
Validated the suitability of graph rewrite systems for compiler tasks
Abstract
The challenge of the Compiler Optimization Case is to perform local optimizations and instruction selection on the graph-based intermediate representation of a compiler. The case is designed to compare participating tools regarding their performance. We tackle this task employing the general purpose graph rewrite system GrGen.NET (www.grgen.net).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.