|Compiler back-ends [Q] Ben.Sloman@reading.ac.uk (1995-10-21)|
|Re: Compiler back-ends [Q] firstname.lastname@example.org (1995-10-23)|
|Re: Compiler back-ends [Q] email@example.com (1995-10-25)|
|Re: Compiler back-ends [Q] firstname.lastname@example.org (1995-10-27)|
|Re: Compiler back-ends [Q] email@example.com (1995-10-29)|
|Re: Compiler back-ends [Q] Martin.Jourdan@inria.fr (1995-11-03)|
|Re: Compiler back-ends [Q] firstname.lastname@example.org (Sebastian Schmidt) (1995-11-03)|
|Re: Compiler back-ends [Q] email@example.com (1995-11-03)|
|From:||Sebastian Schmidt <firstname.lastname@example.org>|
|Date:||Fri, 3 Nov 1995 09:44:34 GMT|
email@example.com (Cliff Click) writes:
>Note that this is a _far_ cry from having the entire backend generated
>automatically. It's just instruction selection and some peephole
>opts. Register allocation is an amazing can of worms, and I don't know
>of any machine-generated code techniques being used there.
firstname.lastname@example.org (Christian Collberg) writes:
>The BEG back-end generator automatically generates a register
>allocator based on a description of the register set (register
>names, register classes, double registers, etc). You also get
>a choice between a fast/dumb and a slow/smart allocator.
There is also the Marion system. It generates a backend doing
instruction selection, instruction scheduling and register allocation
from a machine description.
author = "David G.~Bradlee and Susan J.~Eggers and Robert
title = "The marion system for retargetable instruction
volume = 26,
number = "6",
pages = "229--240",
note = pldi91,
journal = sigplan,
year = 1991,
month = jun,
organization = acm,
address = "Toronto, Ontario, Canada"
phone: (+49) 3641 631398
fax: (+49) 3641 631400
May your disk buffers flush before powerdown!
Return to the
Search the comp.compilers archives again.