Compiler Optimizations for Low-level Redundancy Elimination: An Application of Meta-level Prolog Primitives (1992)
| Venue: | Proc. Third Workshop on Metaprogramming in Logic (META-92 |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Debray92compileroptimizations,
author = {Saumya K. Debray},
title = {Compiler Optimizations for Low-level Redundancy Elimination: An Application of Meta-level Prolog Primitives},
booktitle = {Proc. Third Workshop on Metaprogramming in Logic (META-92},
year = {1992}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Much of the work on applications of meta-level primitives in logic programs focusses on high-level aspects such as source-level program transformation, interpretation, and partial evaluation. In this paper, we show how meta-level primitives can be used in a very simple way for low-level code optimization in compilers. The resulting code optimizer is small, simple, efficient, and easy to modify and retarget. An optimizer based on these ideas is currently being used in a compiler that we have developed for Janus [6]. 1 Introduction Much of the work on applications of meta-level primitives in logic programs focuses on high-level aspects such as source-level program transformation, interpretation, and partial evaluation. In this paper, we consider instead the use of meta-level Prolog primitives in low-level code optimization in compilers. We show how such primitives can be used in a very simple way for a low-level code optimization called common subexpression elimination. The resu...
