Title :
Drawing execution graphs by parsing
Author :
de Bruyn, G.A.M. ; Van, O. S Roosmalen
Author_Institution :
Dept. of Comput. Sci., Eindhoven Univ. of Technol., Netherlands
Abstract :
We present an algorithm for drawing execution graphs. Such graphs represent the control flow in a program. The fact that a program is constructed according to a grammar is reflected in the corresponding execution graph. Therefore, we introduce graph 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
Keywords :
computational complexity; data flow analysis; flowcharting; graph grammars; control flow; execution graph drawing; generally used programming language constructs; grammar; graph production rules; graph topologies; parsing; Computer languages; Computer science; Data mining; Neck; Operating systems; Processor scheduling; Production; Programming profession; Real time systems; Topology;
Conference_Titel :
Parallel and Distributed Real-Time Systems, 1995. Proceedings of the Third Workshop on
Conference_Location :
Santa Barbara, CA
Print_ISBN :
0-8186-7099-1
DOI :
10.1109/WPDRTS.1995.470499
