Optimizing compiler

An optimizing compiler is a <a href="/facts/Compiler/WNfCDFJe">compiler</a> designed to generate code that is <a href="/facts/Program_optimization/nXz6RpRM">optimized</a> in aspects such as minimizing program <a href="/facts/Execution_time/lCxKsrzB">execution time</a>, <a href="/facts/Memory_usage/vthLkUpz">memory usage</a>, storage size, and <a href="/facts/Power_consumption/eEl4r39x">power consumption</a>. Optimization is generally implemented as a sequence of optimizing transformations, a.k.a. compiler optimizations – algorithms that transform code to produce semantically equivalent code optimized for some aspect.
Optimization is limited by a number of factors. Theoretical analysis indicates that some optimization problems are <a href="/facts/NP-complete/NFPv56DU">NP-complete</a>, or even <a href="/facts/Undecidable_problem/QBxmXBbY">undecidable</a>. Also, producing perfectly optimal code is not possible since optimizing for one aspect often degrades performance for another. Optimization is a collection of <a href="/facts/Heuristic/BcBEkv9c">heuristic</a> methods for improving resource usage in typical programs.: 585

Optimizing compiler open-in-new

Optimizing compiler