I don't picture a tail, if that's what you mean. You aren't a proper computer scientist or software developer if you do. You are deviant furfag scum of society who must be purged if you envision a tail.
One must imagine a recursive stack where the state of the stack at all previous recursive steps is no longer needed so it can be collapsed in on the current step.
Instead of opening another thread, I'll just ask here:
If a C procedure uses cdecl, and tail calls to a procedure with a not compatible signature (e.g. (int, int) and (float, char*, int)), tail call optimization would be impossible to do, right?
Name:
Anonymous2011-04-03 0:57
>>12
That's a butthurt faggot unaware of the fact that Python is just a glorified scripting language. It's made to coordinate C/C++ libraries made by autistic faggots, such as you, dear reader.
Name:
Anonymous2011-04-03 0:58
>>13
If you knew how asm works, you'd know the answer is that tail call optimization works whenever you have a tail call. That's why it's called tail call optimization. Hurr fucking durr.