5 Graph Description Language (GDL) - Absint

Figure 14: Bent Near, Right-Bent Near and Anchor Edges
09 bentnearedge: { source: "A" target: "B" }
10 nearedge: { source: "A" target: "C" }
11 backedge: { source: "C" target: "D" }
12 edge: { source: "D" target: "E" anchor: 1}
13 edge: { source: "D" target: "A" anchor: 2}
14 }
5.6.2 Control Flow Graph
The following three graphs show the control flow graph of a procedural program. The nodes
contain the text of statements as labels. Not all edges have labels. The visualized control flow
comes from the following nonsense program, which consists of a procedure test and a main
routine in a pseudo imperative language.
PROCEDURE test( VAR b : INTEGER; c : INTEGER );
BEGIN
b := c + 5;
END
BEGIN // main routine of a nonsense program
x := 1;
WHILE (x = 1) DO
x := 2;
test ( x, 1 );
x := 3;
OD;
WHILE (x = 1) DO
x := 4;
x := 5;
test ( x, 2 );
49