Program Compression

Abstract

The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store and execute the program. The idea is to start with a simple context-free grammar that
represents all valid basic blocks of any program. We represent a program
by the parse trees (i.e. derivations) of its basic blocks using the grammar.
We then modify the grammar, by considering sample programs, so that
idioms of the language have shorter derivations in the modified grammar.
Since each derivation represents a basic block, we can interpret the resulting set of derivations much as we would interpret the original program.
We need only expand the grammar rules indicated by the derivation to
produce a sequence of original program instructions to execute.
The result is a program representation that is approximately 40% of
the original program size and is interpretable by a very modest-sized
interpreter.