Well I've made a little Huffman encoder thanks to the help I've received here with classes and the notion of them pointing to each other.

Huffman coding is a cool way to compress data by using binary search trees.It lets you use fractional bytes for characters instead of whole bytes.

My program simply outputs the binary string for each character. I believe it to be accurate from some simple testing...You could probably make a simple GUI interface for saving and loading strings as bytes.This was just for fun.

(defparameter *words* "Farewell and adieu to you, Spanish LadiesFarewell and adieu to you, ladies of SpainFor we've received orders for to sail for old EnglandBut we hope in a short time to see you again")