I was considering how to do if we had tail recursion.
We do have tail recursion. Well not really: sort of. That's courtesy of magic goto: but then of course one has to explicitly make use of it, not that TR is automatically recognized, which is what you clearly meant.
In reply to Re^3: finding number of contiguous letters
by blazar
in thread finding number of contiguous letters
by Marknel
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |