Content deleted Content added
→Measure of the "structureness" of a program: actually, it's not exactly the same |
|||
Line 47:
</source>
The idea of CFG reducibility by successive collapses of sub-graphs (ultimately to a single node for well-behaved CFGs) is also used in modern compiler optimization. The areas of the CFG that cannot be reduced to "nice" programs, technically called [[natural loop]]s (which have a rather involved definition that we elide in this article), are called ''improper regions'', and these regions end up having a relatively simple definition: multiple-entry strongly connected components of the CFG. (Multiple exits do not cause problems to modern compilers. Thus the simplest improper region is a loop with two entry points.) Improper regions cause additional difficulties in optimizing code.<ref name="Muchnick1997">{{cite book|author=Steven S. Muchnick|title=Advanced Compiler Design Implementation|year=1997|publisher=Morgan Kaufmann|isbn=978-1-55860-320-2|pages=196-197}}</ref>
==See also==
| |||