[comp.lang.lisp] Number of recursion

c264-aq@mercury.Berkeley.EDU (Class Account) (03/29/90)

I am wondering how deep a Lisp recursive function should go.  What are the 
usual recursion depth most lisp implementation have?

I am writing a Common Lisp interpretor in C.  The run time stack size for the
interpretor is about 16k, and the depth of the Lisp recursive function call
is about 60.  Is it enough for most casual use of Lisp?  Are there ways to
improve the recursive depth besides increasing the run time stack?


-William