retroforth/example/recursive-fibonacci.retro

# example|RecursiveFibonacci

~~~
:fib (n-m)
  dup
  [ n:zero? ] [ #1 eq? ] bi or
  not 0; drop
  [ n:dec fib ] sip
  [ #2 - fib ] call + ;
~~~
Initial checkin (from 58fa921 in the old git repo) FossilOrigin-Name: d2b8467883db80cb179089e1db1b1ed4dff1f11b4bee7086ee46d83f3ee0136e 2017-10-16 18:09:39 +02:00			`# example\|RecursiveFibonacci`

no longer use ```` for code blocks; this fence sequence will be used for embedded tests in a later update FossilOrigin-Name: dfed0de00b8d63672a882b79c4951cce0076007ef208c063b2f4e54fe9bd08f8 2018-04-25 18:57:28 +02:00			`~~~`
Initial checkin (from 58fa921 in the old git repo) FossilOrigin-Name: d2b8467883db80cb179089e1db1b1ed4dff1f11b4bee7086ee46d83f3ee0136e 2017-10-16 18:09:39 +02:00			`:fib (n-m)`
			`dup`
			`[ n:zero? ] [ #1 eq? ] bi or`
			`not 0; drop`
			`[ n:dec fib ] sip`
			`[ #2 - fib ] call + ;`
no longer use ```` for code blocks; this fence sequence will be used for embedded tests in a later update FossilOrigin-Name: dfed0de00b8d63672a882b79c4951cce0076007ef208c063b2f4e54fe9bd08f8 2018-04-25 18:57:28 +02:00			`~~~`