In a reducible graph All the loops are natural loops There are no jumps in the middle of a loop Improper regions are multiple entry strongly connected regions Programming languages do not allow irreducible flow graphs Fortran with loops of if and gotos construct irreducible flow graphs Most of the optimizations do not work for irreducible flow graphs Node splitting is a possible solution