Method for constructing a graph data structure

A computing device capable of compiling a source code into executable machine code running on one or more processors, the computing device comprising:

• a memory storage comprising instructions;
• and
• one or more processors in communication with the memory storage, wherein the one or more processors execute the instructions for:
• constructing a graph data structure as an intermediate representation of the source code, wherein the source code is represented in an object-oriented programming language by objects of classes, the constructing further comprising:
• obtaining an operation in the source code, the operation comprising an operand;
• creating a first new node of the graph data structure using the operand, wherein the new node comprises a factory method;
• producing one or more new nodes of the graph data structure by calling the factory method of the first new node, and subsequently producing more new nodes by calling factory methods in existing nodes in the graph data structure until all nodes of the graph data structure are represented by symbols, wherein an existing node of the graph data structure comprises a factory method based on a type of the first new node of the graph data structure and is associated with a class, and wherein producing a new node using the existing node comprises calling a factory method of the class associated with the existing node and returning a corresponding function to provide a corresponding symbol to the new node;
• and
• using the symbols as proxies of the nodes of the graph data structure to generate functional calls for implementing the source code.

A non-transitory computer-readable medium storing computer instructions for implementing a method for constructing a graph data structure as an intermediate representation of source code for a compiler, that when executed by one or more processors, cause the one or more processors to compile the source code into executable machine code running on the one or more processors, wherein the source code is represented in an object-oriented programming language by objects of classes, the method comprising:

• obtaining an operation in the source code, the operation comprising an operand;
• creating a first new node of the graph data structure using the operand, wherein the new node comprises a factory method;
• producing one or more new nodes of the graph data structure by calling the factory method of the first new node, and subsequently producing more new nodes by calling factory methods in existing nodes in the graph data structure until all nodes of the graph data structure are represented by symbols, wherein an existing node of the graph data structure comprises a factory method based on a type of the first new node of the graph data structure and is associated with a class, and wherein producing a new node using the existing node comprises calling a factory method of the class associated with the existing node and returning a corresponding function to provide a corresponding symbol to the new node;
• and using the symbols as proxies of the nodes of the graph data structure to generate functional calls for implementing the source code.