Patent ID: 7565646
Filing Date: 2009-07-21
Classification: G06F

Abstract:
1. A method for compressing an interpreted object code of a program or a programs set comprising a sequence of code instructions in a system with a usual stack machine type interpreter having an operand stack and possibly an internal stack, said interpreter being adapted to perform software interpretation of said code instructions into instructions in machine language, which are directly executable by a processor, and being configured by using said internal stack or a shift of said operand stack in relation to new instructions, said method comprising the following steps: a first step of constructing a representation of calculations performed by said program or programs set in a form of arborescent expressions, a second step of identifying, in said arborescent expressions, sub-expressions corresponding to recurring sequences, said recurring sequences comprising complete trees or being configured by arguments, a third step of associating new instructions of the interpreter respectively with said recurring sequences, a fourth step of reconstructing an interpreted object code form from a representation of arborescent expressions, by replacing a code corresponding to the recurring sequences with not-necessarily-contiguous instruction groups identified by an associated new instruction, a fifth step of configuring said interpreter by adding thereto definitions of said new instructions so as to render it capable of interpreting the interpreted object code reconstructed in the fourth step.