1. A method for computer program optimization, comprising the steps of: representing first machine instructions of a first program comprising post-linked execution code having a function therein as respective expression trees having nodes and leaves and edges, the nodes representing assignment operators, calculation operators, and resolution operators, and logical equivalence operators, and resources, the edges representing execution paths between the nodes, and the leaves representing machine resources and operations; reorganizing at least a portion of the expression trees in the function of the first program to form reorganized expression trees that represent second machine instructions that are fewer in number than the first machine instructions; generating a second program of transformed code by respectively replacing the first machine instructions with the second machine instructions; and converting the transformed code into a third program of post-linked execution code that includes the second machine instructions in the function.