This benchmark compresses data, using a modified Lempel-Ziv method (LZW).
Basically finds common substrings and replaces them with a variable size code.
This is deterministic, and can be done on the fly. Thus, the decompression procedure
needs no input table, but tracks the way the table was built. Algorithm from
"A Technique for High Performance Data Compression",
Terry A. Welch, IEEE Computer Vol 17, No 6 (June 1984), pp 8-19.
This is a Java port of the 129.compress benchmark from CPU95, but improves upon that benchmark in that it compresses real data from files instead of synthetically generated data as in 129.compress.