Re^2: Tail recursion elimination

LR, you're being overly pedantic. Tail call elimination means tail call optimization, even if the words would lead one to suppose otherwise.

We're building the house of the future together.

Comment on Re^2: Tail recursion elimination

Replies are listed 'Best First'.
Re^3: Tail recursion elimination by Limbic~Region (Chancellor) on May 01, 2006 at 12:53 UTC
jdporter, Right - when you re-use the stack frame it is an optimization referred to as elimination. When you don't re-use the stack frame but create a new one, is it still called elimination? Perhaps that is too pedantic. Cheers - L~R	[reply]
Re^4: Tail recursion elimination by billh (Pilgrim) on May 02, 2006 at 11:11 UTC
jdporter Isn't that the same thing? in a stack discipline re-using a stack frame just means popping a frame and then pushing one. Bill H `perl -e 'print sub { "Hello @{[shift]}!\n" }->("World")'` [download]	[reply] [d/l]
Re^4: Tail recursion elimination by Anonymous Monk on May 01, 2006 at 18:26 UTC
Um, goto &SUB does create a new stack frame, but only after the old one is stripped off. (Shouldn't leak memory though.)	[reply]
Re^5: Tail recursion elimination by Limbic~Region (Chancellor) on May 01, 2006 at 18:28 UTC
Anonymous Monk, Ok - you have copied/pasted from the same node I have linked to twice now. What exactly is it that you think I am missing? Cheers - L~R	[reply]