Well, I thought about compressing it and bundling the
results with a decompressor and eval, but the only type
of compression I'm very familiar with is Huffman, and
even after I renamed some variables and things to cut
down on the number of distinct characters, the character
set is still too broad for the size of the program, and
so by the time I have to use only six of every eight
bits to ensure that all the characters are printable,
I can't get compression good enough to make room for
the decompressor and tree, much less come out
seventy-some keystrokes shorter.
$;=sub{$/};@;=map{my($a,$b)=($_,$;);$;=sub{$a.$b->()}}
split//,".rekcah lreP rehtona tsuJ";$\=$ ;->();print$/
| [reply]
[d/l] |
