Olin Lathrop wrote:
>
> > 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.

Ha ha! Of course! After 8 calls the original address
will be rubbed... Whooops! I'll work on my projects HARDWARE
today I think. It's a good day for hardware! ;o)
-Roman

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