Well, when I want to convert a function that uses recursion but the stack isn't big enough, I make it have a queue where each new item goes on the end, and the next item goes from the front of the queue. This way the stack is replaced by the heap (which is much bigger!).
Here are a few good authors, reading their software is very educational -
a) Edi Weitz - http://weitz.de/. Writes very clean and well documented code.
b) Paul Graham - The On Lisp book examples, http://arclanguage.org/install (for the source code of news.ycombinator )
c) The Code in - "The Little Schemer" - the best introduction to the lisp way of thinking.
9 comments
[ 3.8 ms ] story [ 40.1 ms ] threadI am looking for beautiful Scala code to read. Any pointers greatly appreciated.
http://www.cs.northwestern.edu/academics/courses/325/reading...
Useful stuff in there.
If you're gonna a make a 'sufficiently smart compiler' argument, get it right. I think you meant "tail calls into jumps".