Drawing Execution Graphs by Parsing

摘要

In this paper, we present an algorithm for drawing execution graphs. We introducegraph production rules that are based on generally used programming language constructs. Each rule is applied to a certain class of topologies of the graph. By parsing an execution graph according to these rules, a visually appealing layout of the graph can be generated. We take into account that the nodes in a graph can have variable sizes.