Related articles |
---|
Compilers in six hours macrakis@osf.org (1994-05-12) |
Re: Compilers in six hours chase@Think.COM (1994-05-17) |
Re: Compilers in six hours grunwald@widget.cs.colorado.edu (1994-05-17) |
Re: Compilers in six hours hbaker@netcom.com (1994-05-18) |
Compilers in six hours ssimmons@convex.com (1994-05-18) |
Compilers in six hours ssimmons@convex.com (1994-05-19) |
Re: Compilers in six hours anton@mips.complang.tuwien.ac.at (1994-05-19) |
Re: Compilers in six hours chase@Think.COM (1994-05-19) |
Re: Compilers in six hours hbaker@netcom.com (1994-05-20) |
Re: Compilers in six hours monnier@di.epfl.ch (Stefan Monnier) (1994-05-22) |
Re: Compilers in six hours munk@prl.philips.nl (1994-05-24) |
Re: Compilers in six hours li@marcus.cs.umn.edu (1994-05-24) |
Re: Compilers in six hours cytron@kato.wustl.edu (1994-05-25) |
[1 later articles] |
Newsgroups: | comp.compilers |
From: | anton@mips.complang.tuwien.ac.at (Anton Ertl) |
Keywords: | courses |
Organization: | Institut fuer Computersprachen, Technische Universitaet Wien |
References: | 94-05-066 |
Date: | Thu, 19 May 1994 12:36:44 GMT |
David Chase wrote:
> 6. Actually doing a good job of machine-language generation nowadays is
> probably nasty enough to justify a course in itself.
Hmm, I just did the code generation talk of our compiler course in an
hour. It consists of three parts:
code selection (tree grammars and tree pattern matching)
instruction scheduling (data dependence graph, list scheduling)
register allocation (live ranges, interference graph, graph colouring)
Maybe the code selection part was too concise, but I think I did fine
on scheduling and register allocation. Of course, a lot of things have
been explained earlier (intermediate representation etc).
- anton
M. Anton Ertl anton@mips.complang.tuwien.ac.at
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.