🚀 go-pugleaf

In response number 1 to this note I presented a program in FORTH which
was followed by the statement "this example helped me decide that I should
not be programming in FORTH".  The response was a series of near violent
messages essentially excommunicating me from the FORTH community.  Let me
say that the remark I made was meant only as tongue-in-cheek humor and I
had no wish to offend anyone by it.  Please accept my apologies and rest
assured I will not make that mistake again!  Now, if some FORTH expert can
send me code for the fibonacci number problem which looks readable and runs
I will be grateful.  (One respondant sent a piece of code which looked
readable but contained the string [recursive] which meant there exists some
code that I can put in place of [recursive] to get a recursive fibonacci
program but that code depends on the particular implementation of FORTH I was
using - if anyone knows what this code is for the Dragon FORTH I would be
grateful if you send it to me).

P.S. I have been given a copy of Dr. Dobb's Journal which has an article
on recursion in FORTH (Feb. 1982, 7, 2, 64) for anyone interested. An example
(factorial) goes like this:

: THISCODE CURRENT @ @ PFA CFA ; IMMEDIATE
: FAC DUP 2 = IF ELSE DUP 1 - THISCODE LITERAL EXECUTE
                   * ENDIF ;

I would be grateful if a FORTH expert would send me mail telling me whether
this is well programmed FORTH.  Thank you.