Related articles |
---|
Re: Writing fast compilers... pcg@aber.ac.uk (1991-08-11) |
Re: Writing fast compilers... preston@helena.rice.edu (1991-08-11) |
Re: Writing fast compilers... pardo@gar.cs.washington.edu (1991-08-13) |
Re: Writing fast compilers... davidsen@crdos1.crd.ge.com (1991-08-13) |
Re: Writing fast compilers... preston@helena.rice.edu (1991-08-13) |
Re: Writing fast compilers... alex@vmars.tuwien.ac.at (1991-08-13) |
Re: Writing fast compilers... pcg@aber.ac.uk (1991-08-14) |
Re: Writing fast compilers... markh@csd4.csd.uwm.edu (1991-08-16) |
Re: Writing fast compilers... glew@pdx007.intel.com (1991-08-16) |
Re: Writing fast compilers... blenko-tom@CS.YALE.EDU (1991-08-16) |
Re: Writing fast compilers... brnstnd@kramden.acf.nyu.edu (1991-08-18) |
Re: Writing fast compilers... henry@zoo.toronto.edu (1991-08-20) |
Re: Writing fast compilers... andy@DEC-Lite.Stanford.EDU (1991-08-21) |
Newsgroups: | comp.compilers |
From: | markh@csd4.csd.uwm.edu (Mark William Hopkins) |
Keywords: | performance, design |
Organization: | University of Wisconsin - Milwaukee |
References: | <20167@helios.TAMU.EDU> <PCG.91Aug11154854@aberdb.aber.ac.uk> 91-08-051 |
Date: | 16 Aug 91 06:00:28 GMT |
In article 91-08-051 davidsen@crdos1.crd.ge.com (bill davidsen) writes:
> Note that true one pass compilers can not generate best possible code
>for some machines, notably those which have a short branch instruction,
>since forward jumps must be coded as long jumps.
Evreything can always be done in one pass. The distinction is wholly
artificial. Use logical variables or something equivalent, and Unification
(or something equivalent). It's easy to think up an algorithm, based on
Unification, doing a "least fixed point" calculation, for optimally
resolving branches (once you know what Unification is).
Relocatable assemblers, in fact, already have half the concept there: segment
bases (resolved at link-time) are logical variables ... only the authors of
the assemblers typically don't recognize that, and so don't see the obvious
application of the Unification algorithm (in the linker).
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.