All geek questions in one place

Practical differences between the control flow graph and the call schedule (flow?)?

Wikipedia has a definition for a control flow graph . I also heard terminology that referred to the "call (flow?) Graph", but could not find the appropriate resources. What is the relationship between them?

+4
source share
1 answer

Wikipedia defines a call schedule as a representation of the relationship of calls between routines in a program. In the call graph, the edge between the two nodes f and g :

  f --> g

means that routine f calls routine g . The call schedule gives an interprocedural view of the program.

The control flow graph (CFG) provides finer “details” in the structure of the program as a whole and, in particular, of the subprograms. For example, the CFG of routine f will make explicit all the paths called by the conditional branch:

  / branch1 \ begin --> condition --> --> codeblock --> g --> end \ branch2 /

This type of CFG is used to create an in-process representation of a subroutine.

+18
source

Source: https://habr.com/ru/post/1403649/

More articles:


All Articles