On 9/11/2006 at 2:04 AM Alexey Toptygin wrote:
I was reading the C language spec (C99) and I got to
wondring: are/were
there C implementations that had no stack, or a rising stack? There's a
falling stack in every implementation I've seen, but the spec doesn't
require it.
I don't see any practical difference between a stack that increments with a
push and one that decrements with one; mostly it seems like a detail.
It's pretty much a given that any situation involving a subroutine that can
call itself demands a LIFO stack structure of some sort, though. How
else might one implement recursive calls otherwise?
Cheers,
Chuck