🚀 go-pugleaf

> : fib ( n ) DUP 3 < IF  DROP 1  ( return 1 for 1 or 2, assumes n>=1  )
>                     ELSE  [ SMUDGE ]  ( allow for recursion )
>                         DUP 1- fib    ( here is your fib{n-1}  )
>                         SWAP 2- fib   ( followed by  fib{n-2}  )
>                         +  [ SMUDGE ] ( sum two fib s, end recursability )
>                     THEN  ;

If you the SMUDGE method make sure that there is a matching pair (as above).

I believe Fig-Forth SMUDGE toggles the smudge (visability) bit.

The ';' defining word will flip the bit also, so watch-out or you may
	end up with an 'invisible' word.

Jeff Bartlett
Center for Digital Systems Research
Research Triangle Institute				rti-sel!jb@mcnc