... an example of using a recursive function to do the duplicate ... /> [code]
2 DEF FN a()=FN r(1+INT (RND*49 ... )):
DEF FN r(x)=VAL (("FN a()" AND a(x ... 6
80 LET a(FN a())=n
110 NEXT ...

... an example of using a recursive function to do the duplicate ... /> [code]
2 DEF FN a()=FN r(1+INT (RND*n ... )):
DEF FN r(x)=VAL (("FN a()" AND a(x ... -1
80 LET a(FN a())=50-n
110 ...

Here's a recursive DEF FN INSTR one-liner, cunningly contrived ... it in a separate function "FN c(c,o$)" didn't ... . I thought that maybe "DEF FN c()=c+LEN o$-1 ... />
[code]
4 DEF FN i(w$,o$,c)=
VAL (("FN i(w$,o$,c+1 ...

... the actual function. The FN P2() was the result ... and develop a single recursive DEF FN which could do the ... it in right this time. FN n() converts between any ... from" parameter in a nested FN b() to convert that result ...
DEF FN n(n,f,t)=FN b(FN b(n,f ...

... have to say that your recursive definition i very very interesting ... =Dr BEEP;544274]1 def fn b$(d)=val$ (("str$ ... />
2 DEF FN c$(d,b)=VAL$ (("FN z$(d)" AND ... d=b))
5 DEF FN z$(d)=CHR$ (d+ ... />
:smile:

And FN c$(45648,36) gives Z80 ...

... have to say that your recursive definition i very very interesting ... />
2 DEF FN c$(d,b)=VAL$ (("FN z$(d)" AND ... d=b))
5 DEF FN z$(d)=CHR$ (d+48 ... />
:smile:

And FN c$(45648,36) gives Z80 ...

LOL - thanks Crisis but I will stick with good old BASin. It delivers everything I need and I can live without recursive DEF FN. ;)

Paddy

I agree with McLeods explanation. An inner FN with a different name has a private parking place and does not need the hidden storage in the same DEF FN statement. Did known recursive functions escape from this by having the inner FN's as the first element?

... solution for those interested. A recursive function needs an evaluating bit ... the CHR$ ... + VAL$ bit, the FN j$ bit and the """""" bit ... addressed byte from memory;
* ("FN j$("+STR$ (s+1)+","+STR ... ( 56168 ) and then VAL$ sees "FN j$((56169),(7))" and so ...

... /> [code]
100 DEF FN b$(n,b$)
=("0 ... b$)
+VAL$ (("FN b$("+STR$ INT (n/2 ... as just 1E+9 but FN b$(999999999,"") prints the ... [code]
(if n0) : FN b$(INT (n/2),STR ... What I need is a recursive DEF FN visualisation utility, which can ...

... /> What I need is a recursive DEF FN visualisation utility, which can ... would be evaluated by the FN call as in the second ... to fix a broken DEF FN.[/QUOTE]
Wouldn't it ... generate an eye-bleeding DEF FN from it.

... loop, then stick the DEF FN in the middle, replace the ... "DEF FN...=" with PRINT, remove any VAL ... should be handy for debugging recursive DEF FNs.

... GO TO, GO SUB, DEF FN (I think that's all ... beforehand then a self-contained FN would work, but it would ... impossible to use nested or recursive FNs - and using a bunch ... of LETs prior to every FN call isn't very pretty ...

... code]
10 DEF FN d(o,w,u)=299 ... plain w in your def fn, but only use it ... br /> [code]
10 DEF FN d(o,u)=299.76148 ...
[code]
10 DEF FN d(o,w,u)=299 ... use it.
its not recursive , or i really mis ... EXP functions in that DEF FN, as each of them ...

... to write certain forms of recursive function. For example, this function ... a string:

DEF FN j$(s,l)=CHR$ PEEK ... (s)+VAL$ (("FN j$("+STR$ (s+1)+","+STR ...

... self-modifying code and a recursive function to boot.
[code ... ) TO ):
LET b(i)=FN i(0,LEN n$): LET ... /> NEXT i
2012 DEF FN i(i,j)=VAL (("(CODE ... $(j)>=""A""))*base^i+FN i(i+1,j-1 ... n.
[code] 10 DEF FN h$(n)=CHR$ (INT n ...

... was a bug in the recursive version of the Hex2Dec function ... $ ($5F5E0FF = 99999999)
3051 DEF FN d(h$)=16^(LEN h ... h$>64))
+VAL (("FN d(h$(2 TO))+" AND ... minor change, I updated the recursive versions of AND, OR, XOR ...

... /> To PS.
The recursive DEF FN to format the time is ... it's being evaluated, the FN uses an extra 1kb of ... only way to stop a recursive string function.

Taking ... Andrew's original non-recursive DEF FN was written assuming that the ...

... )
+STR$ INT (FN V(FN V(FN V(n,1800000),180000 ... /> +STR$ INT (FN V(FN V(FN V(FN V(n,1800000),180000 ... /> STR$ INT (FN V(FN V(FN V(FN V(FN V(n,1800000 ... , just for comparison. The recursive versions are usually substantially smaller ...

... forgot to mention is that recursive DEF FNs are generally, often ... than the equivalent expanded DEF FN, and always use more memory ... always possible to expand a recursive DEF FN (eg. if the terminating ... describes how to calculate DEF FN memory usage. There's a ...

... in strings (eg. in a recursive DEF FN), use TXT2Emu's "{..}" codes ... }; UDG A = {90} (or {A}); FN = {A8}.

... . However the function can be recursive and this leads to much ... in rather amazing one-line recursive DEF FNs.

Unfortunately ... a think.

def fn s(a$)=(a$"" AND VAL ... )) + ((LEN a$ > 1) AND FN s(a$(2 TO)))

... occur in a string (FN and TO in this ... FN s("12345") = 15 for example.

A recursive ... digits left:
VAL (("FN s(a$(2 TO ))+" ...
(this is the recursive looping bit);
or adds ... terminating condition bit, as "FN s(a$(2 TO ))+" ...

... SUB stack. Calling a FN is slower as every statement ... as long as a DEF FN only references its own local ... its parameters within its DEF FN extent which is always ... first; but a DEF FN is restricted in the code ... to a GO SUB routine. Recursive DEF FNs use much more ...