Hmm... It would be interesting to do something similar, but optimizing for output code size. For example, I'm pretty sure that the following is one of the sho

Hmm... It would be interesting to do something similar, but optimizing for output code size. For example, I'm pretty sure that the following is one of the shortest representations of "A" in BF, although it doesn't clean up after itself. -[+>+<[+<]>]>+.