Theory of local register allocation for prolog clauses II

Abstract

When a relative order of an abstract process and of a code rendering is swapped during compilation, then the abstract process relates to compiled clause and not to its abstract code. The proposed algorithms of the optimal register allocation warrant a correspondence between a clause representation and parameters of its abstract code, regardless of the type of occurrence of temporary variables. The feasible optimal abstract code with minimal  length and minimal number of registers is an exact defined surroundings for all subsequent optimizing procedures of the Prolog compiler.