Peephole optimisation
<compiler> A kind of code optimisation that considers only a few adjacent instructions at a time and looks for certain combinations which can be replaced with more efficient sequences.
E.g.
ADD R0, #1 ADD R0, #1
(add one to register R0) could be replaced by
ADD R0, #2
| < Previous Terms | Terms Containing peephole optimisation | Next Terms > |
| PEBKAC PECOS Pedagogic Algorithmic Language PEEK PEEL | program transformation Register Transfer Language Y | peer peer-to-peer Pegasus PEIPA PEM |
