Anonymous recursion: Difference between revisions
→{{header|RPL}}: Truly anonymous recursion
(add RPL) |
(→{{header|RPL}}: Truly anonymous recursion) |
||
Line 2,951:
=={{header|RPL}}==
===Hidden variable===
The recursive part of the function is stored in a local variable, which is made accessible to all the recursive instances by starting its name with the <code>←</code> character.
{{works with|HP|48G}}
Line 2,968 ⟶ 2,969:
1: 55
</pre>
===Truly anonymous===
Both the recursive block and the argument are pushed onto the stack, without any naming. This meets the requirements of the task perfectly and works on any RPL machine, but it is far from idiomatic and uses a lot of stack space.
{{works with|HP|28}}
≪ '''IF''' DUP 0 <
'''THEN''' DROP "Negative value"
'''ELSE'''
≪ '''IF''' DUP 1 > '''THEN'''
DUP2 1 - OVER EVAL
ROT ROT 2 - OVER EVAL +
'''ELSE''' SWAP DROP '''END'''
≫
SWAP OVER EVAL
'''END'''
≫ '<span style="color:blue">FIBAR</span>' STO
=={{header|Ruby}}==
| |||