Re: Looking for a compiler for research work

sethml@ugcs.caltech.edu (Seth LaForge)
22 Apr 1997 21:26:09 -0400

          From comp.compilers

Related articles
Looking for a compiler for research work mtandon@menger.eecs.stevens-tech.edu (Manu Tandon) (1997-04-18)
Re: Looking for a compiler for research work jlilley@empathy.com (John Lilley) (1997-04-20)
Re: Looking for a compiler for research work sc@informatik.uni-jena.de (Sebastian Schmidt) (1997-04-22)
Re: Looking for a compiler for research work scotth@visix.com (1997-04-22)
Re: Looking for a compiler for research work sethml@ugcs.caltech.edu (1997-04-22)
Re: Looking for a compiler for research work llsmith@super.org (1997-05-04)
| List of all articles for this month |

From: sethml@ugcs.caltech.edu (Seth LaForge)
Newsgroups: comp.compilers
Date: 22 Apr 1997 21:26:09 -0400
Organization: California Institute of Technology, Pasadena
References: 97-04-105
Keywords: tools

On 18 Apr 1997 00:45:02 -0400, Manu Tandon <mtandon@menger.eecs.stevens-tech.edu> wrote:
>I am looking for a compiler to do some optimisation research. I have
>read the free compilers list. I wanted to know what compiler is easy /
>easier to hook into.


Check out the Stanford SUIF project: http://suif.stanford.edu/. SUIF
(Stanford Universal Intermediate Format) is a specification of an
intermediate format on disk, C and Fortran front-ends, MIPS and C
back-ends, a C++ library for reading, writing, and manipulating the
intermediate instructions, and a bunch of optimizers. The idea is
that you can write your optimizer as an independent program which
reads code in intermediate form and writes optimized code in
intermediate form. The SUIF group is mostly using it for researching
automatic parallelization.


SUIF was used for an optimization class taught here at Caltech. I
found it to a bit byzantine, and a major pain to install, but it's
great for doing optimization projects/research.


Seth
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.