Compiler Optimization: A Case for the Transformation Tool Contest

Details Compiler Optimization: A Case for the Transformation Tool Contest Compiler Optimization: A Case for the Transformation Tool Contest

2011-11-21

arxiv.org/abs/1111.4737v1

EPTCS 74, 2011, pp. 6-16

Computer Science

Programming Languages

In Proceedings TTC 2011, arXiv:1111.4407

Scientific paper

10.4204/EPTCS.74.2

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.

Affiliated with

Also associated with

No associations

Rating

Compiler Optimization: A Case for the Transformation Tool Contest does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compiler Optimization: A Case for the Transformation Tool Contest, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compiler Optimization: A Case for the Transformation Tool Contest will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-375978