> Since the stack
> is circular, you could call a function ANY amount of times,
> and return the same amount of times, provided:
> * It was originally called from the top level
> * no ints or other functions were called.
>
> This would give an option to do a recursive activity
> a very large number of times??

An infinite number of times, actually.  That is because the recursive
routine would only be able to return to itself and no longer be able to
return to the original caller.

If you think about it hard enough, you can probably contrive a case where
you can use the limited stack as a "feature", but I personally don't want to
go there.


*****************************************************************
Olin Lathrop, embedded systems consultant in Devens Massachusetts
(978) 772-3129, olin@embedinc.com, http://www.embedinc.com

--
http://www.piclist.com hint: To leave the PICList
mailto:piclist-unsubscribe-request@mitvma.mit.edu