piclist 2001\01\26\090625a >
Thread: Stack Overflows
face picon face BY : Olin Lathrop email (remove spam text)

> 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, olinRemoveMEspamSTOPspamembedinc.com, http://www.embedinc.com

http://www.piclist.com hint: To leave the PICList

<000b01c0879e$d858e1a0$260bf6cd@pc> 7bit

See also: www.piclist.com/techref/microchip/devices.htm?key=pic
Reply You must be a member of the piclist mailing list (not only a www.piclist.com member) to post to the piclist. This form requires JavaScript and a browser/email client that can handle form mailto: posts.
Subject (change) Stack Overflows

month overview.

new search...