Extended Basic Block

• Maximal sequence of instructions begining with a header and no other join nodes
• Single entry multiple exits block

• Depth first traversal contains (i) all the nodes and (ii) edges which make depth first order. This is called depth first spanning tree.
• Forward edges: from a node to descendent
• Back edges: go from node to ancestor
• Cross edges: connects nodes such that neither is an ancestor in dfs