A trick I've used for parsing left- and right-recursive grammar rules without recursion, when hand-writing a recursive descent parser.
An obfuscated ASCII Mandelbrot set renderer in 228 bytes of C code.