Anonymous recursion: Difference between revisions
m
→{{header|Quackery}}: improved text
(Added Quackery.) |
m (→{{header|Quackery}}: improved text) |
||
Line 2,336:
would cause the nest <code>[ dup 1 - recurse ]</code>to be evaluated, and the program would go into a tailspin, recursively evaluating that nest until the return stack overflowed.
This limitation can be overcome with the understanding that recursion can be factored out into two ideas, i.e. self
The final example fixes the previous example by
<pre>[ dup 0 < iff
|