Automated translation of source programs

Abstract

The principles of constructing the representation of a program code in the form of a graph are considered. It is shown that such a graph can be synthesized using methods based on the theory of program algebras. It is proposed to use algorithmic algebras as a universal and syntactically independent means of representing program code. The paper considers an example of the synthesis of a problem graph for a C code.