Generating Control Flow Graphs for Ada Programs

Many code optimisation and analysis techniques depend on the representation of a program in form of a control flow graph. Nowadays, several tools that generate control flow graphs out of source code exist. Until we started our project, there were no such utilities for Ada. The purpose was to develop a program that generates control flow graphs for arbi-trary Ada programs, and lets other tools access this information. As an interface to the Ada environment we used ASIS-for-GNAT. It provides us with the abstract syntax tree, that we use as input for our transformation. The control flow graph is generated during a single inorder traversal of the syntax tree. However, after that main transformation phase further refinement is done