Related articles |
---|
Generating optimal jump code for control flow instructions seescreen@gmail.com (SeeScreen) (2009-06-14) |
Re: Generating optimal jump code for control flow instructions seescreen@gmail.com (SeeScreen) (2009-06-23) |
Re: Generating optimal jump code for control flow instructions torbenm@pc-003.diku.dk (2009-06-24) |
From: | SeeScreen <seescreen@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Sun, 14 Jun 2009 11:24:11 -0700 (PDT) |
Organization: | Compilers Central |
Keywords: | code, question |
Posted-Date: | 14 Jun 2009 19:12:14 EDT |
I am estimating that generating an absolute minimal number of
instructions, and short-circuiting the compound condtional at the
earliest possible point in the execution trace has probably already
been accomplished for many years.
Is this old hat, or something new?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.