Re^7: Syntactic sugar for tail call optimizations

Well - believe it or not - I knew. But your undocumented cut&paste doesn't worth it.

Hm. I assumed you'd remember from the last time we dicussed this.

You bottled out of supporting your own pretensions that time also.

This thread is about implementating tail call recursions,

This thread is about syntactic alternatives to goto &sub for implementing tail-call patterns

Next?

sabotage threads you consider heretical.

I don't consider the ~~thread~~ OP heretical, just a bad conclusion drawn on the basis of poor examples.

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^7: Syntactic sugar for tail call optimizations

Replies are listed 'Best First'.
Re^8: Syntactic sugar for tail call optimizations by LanX (Saint) on May 28, 2011 at 10:28 UTC
Thats off topic. If you can't find an iterative version of the recursion in Re^11: Finding All Paths From a Graph From a Given Source and End Node better start a new thread and ask. Cheers Rolf	[reply]
Re^9: Syntactic sugar for tail call optimizations by Anonymous Monk on May 30, 2011 at 00:03 UTC
Thats off topic. why?	[reply]
Re^10: Syntactic sugar for tail call optimizations by LanX (Saint) on May 30, 2011 at 11:59 UTC
The graph search in Re^11: Finding All Paths From a Graph From a Given Source and End Node is a branch and bound algorithm, i.e. it returns values which are processed by the caller. A Tail call is a subroutine ... that produces a return value, which is then immediately returned by the calling procedure. Writing the branch and bound as iteration is always possible but is IMHO not necessarily a tail call. (though in this case it could be possible to transform it into a tail call) Cheers Rolf	[reply]