Advertisement

Appendix

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2628)

Abstract

A control flow graph (CFG) of a program is defined by a directed flow graph G = (N, E, x, y) with a set of nodes N and a set of edges \( E \subseteq N \times N \) . A node uN represents a program instruction (statement), an edge u → v ∈ E indicates transfer of control between instructions u, vN. Node xN and node yN are the unique start and end node of G, respectively. Consider the control flow graph in Fig. 9.1. We have a set of nodes N = x, 1,..., 7, y and a set of edges. The start node is denoted by x and the end node by y.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Personalised recommendations