Re: Compiler back-ends [Q]

cliffc@ami.sps.mot.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.


collberg@cs.aukuni.ac.nz (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.


@Article{ bradlee:91a,
    author = "David G.~Bradlee and Susan J.~Eggers and Robert
R.~Henry",
    title = "The marion system for retargetable instruction
scheduling",
    volume = 26,
    number = "6",
    pages = "229--240",
    note = pldi91,
    journal = sigplan,
    year = 1991,
    month = jun,
    organization = acm,
    address = "Toronto, Ontario, Canada"
}


--
e-mail: sc@iaxp01.inf.uni-jena.de
phone: (+49) 3641 631398
fax: (+49) 3641 631400
May your disk buffers flush before powerdown!
--

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