|[3 earlier articles]|
|Re: Writing fast compilers... firstname.lastname@example.org (1991-08-13)|
|Re: Writing fast compilers... email@example.com (1991-08-13)|
|Re: Writing fast compilers... firstname.lastname@example.org (1991-08-13)|
|Re: Writing fast compilers... email@example.com (1991-08-14)|
|Re: Writing fast compilers... firstname.lastname@example.org (1991-08-16)|
|Re: Writing fast compilers... email@example.com (1991-08-16)|
|Re: Writing fast compilers... blenko-tom@CS.YALE.EDU (1991-08-16)|
|Re: Writing fast compilers... firstname.lastname@example.org (1991-08-18)|
|Re: Writing fast compilers... email@example.com (1991-08-20)|
|Re: Writing fast compilers... andy@DEC-Lite.Stanford.EDU (1991-08-21)|
|From:||blenko-tom@CS.YALE.EDU (Tom Blenko)|
|Organization:||Yale University Computer Science Dept., New Haven, CT 06520-2158|
|References:||<PCG.91Aug11154854@aberdb.aber.ac.uk> 91-08-051 91-08-066|
|Date:||Fri, 16 Aug 1991 20:17:53 GMT|
In article 91-08-066 firstname.lastname@example.org (Mark William Hopkins) writes:
|In article 91-08-051 email@example.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
It's not artificial, it's a practical issue for those who write (assemblers
|Use logical variables or something equivalent, and Unification
|(or something equivalent).
If you're using a language with logical variables and unification, this may be
a satisfactory approach (ref. Warren paper). There's no reason why anyone
needs something so powerful in another language, however, since they only need
|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).
It's not once you realize that there needn't be a unique least fixed
point for this problem.
Return to the
Search the comp.compilers archives again.