mal/tests/step5_tco.mal

;; Testing recursive tail-call function

(def! sum2 (fn* (n acc) (if (= n 0) acc (sum2 (- n 1) (+ n acc)))))

;; TODO: test let*, and do for TCO

(sum2 10 0)
;=>55

(def! res2 nil)
;=>nil
(def! res2 (sum2 10000 0))
res2
;=>50005000


;; Test mutually recursive tail-call functions

(def! foo (fn* (n) (if (= n 0) 0 (bar (- n 1)))))
(def! bar (fn* (n) (if (= n 0) 0 (foo (- n 1)))))

(foo 10000)
;=>0
guide clarifications, but order for step5 tests. 2015-03-15 01:34:49 +03:00			`;; Testing recursive tail-call function`

			`(def! sum2 (fn* (n acc) (if (= n 0) acc (sum2 (- n 1) (+ n acc)))))`

Basic: step7 basics, reader macros. step1,3 tests. Also: - Add some step1 and step3 tests that were discovered during Basic development. - Move PR_MEMORY* to debug.in.bas - Simplify Makefile deps - Fix freeing in steps4-7 when error at deeper level i.e. (prn (abc)) - add SLICE function to support concat implementation. 2016-09-22 07:27:12 +03:00			`;; TODO: test let*, and do for TCO`

guide clarifications, but order for step5 tests. 2015-03-15 01:34:49 +03:00			`(sum2 10 0)`
			`;=>55`

			`(def! res2 nil)`
			`;=>nil`
			`(def! res2 (sum2 10000 0))`
			`res2`
			`;=>50005000`


Reduced the mutually recursive function test size 2015-10-27 23:05:40 +03:00			`;; Test mutually recursive tail-call functions`

			`(def! foo (fn* (n) (if (= n 0) 0 (bar (- n 1)))))`
			`(def! bar (fn* (n) (if (= n 0) 0 (foo (- n 1)))))`

			`(foo 10000)`
			`;=>0`