We introduce a new approach to construct data flow graphs of imperative programs. It is based on graphically specified templates rather than on writing code. To each syntactical unit of the program, our technique assigns a fixed set of graph grammar productions. Given a program, the data flow graph is created by the application of productions according to the syntactical structure of the program. We have implemented our approach with the GraphEd system. This allows designing of the graph grammar on screen and generating a visual representation of the data flow graph automatically from a given program.
Ulrike Peiker, Martin Griebl