Lets P be a program written in Java, C++ etc. Symbolic conversion for P is a translation, presented in Symbolic-language. See more Java-to-Symbolic.

Static version for a symbolic graph for the program P can be shown as a chain of with the following rules:

  • Nodes are command-names for each symbol (see AHO-architecture).
  • Edges are links between symbols (which are link-facts in the AHO-structures).
  • There is a call edge A..B for each semantic connection, wheres symbol A calls symbol B into execution.
  • There is a returning edge from B to A, which holds information, when that information is defined in the grammar of the original language (Java etc). It returns status-information when there is control command active in the existing sequence. Otherwise, the edge only returns to the caller, without any information.


The graph above is an exact code model for Java, but it can be fitted for any language, even for Prolog and Lisp. However, non-imperative language keeps their execution mechanism, which cannot be drawn as simple as in figure above.