If nothing else, implementing a reasonably efficient but basic Scheme interpreter is a short exercise that can be done in a pinch. "Reasonably efficient" is a consequence of the proper tail recursion.