From: Taylor R Campbell <campbell@mumble.net>
Date: Sun, 10 Feb 2019 22:20:32 +0000 (+0000)
Subject: Add some LETREC and LETREC* tests.
X-Git-Tag: mit-scheme-pucked-10.1.10~6^2~7^2~18
X-Git-Url: https://birchwood-abbey.net/git?a=commitdiff_plain;h=29cfa123f542d37ec111ddd3d2d91b7b992f202b;p=mit-scheme.git

Add some LETREC and LETREC* tests.
---

diff --git a/tests/check.scm b/tests/check.scm
index 4a2dae6a7..f808e421a 100644
--- a/tests/check.scm
+++ b/tests/check.scm
@@ -77,6 +77,7 @@ USA.
     "runtime/test-flonum.com"
     "runtime/test-hash-table"
     "runtime/test-integer-bits"
+    "runtime/test-letrec"
     ("runtime/test-library-parser" (runtime library))
     ("runtime/test-library-standard" (runtime library))
     ("runtime/test-library-imports" (runtime library))
diff --git a/tests/runtime/test-letrec.scm b/tests/runtime/test-letrec.scm
new file mode 100644
index 000000000..f390b67ae
--- /dev/null
+++ b/tests/runtime/test-letrec.scm
@@ -0,0 +1,78 @@
+#| -*-Scheme-*-
+
+Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994,
+    1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
+    2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016,
+    2017, 2018, 2019 Massachusetts Institute of Technology
+
+This file is part of MIT/GNU Scheme.
+
+MIT/GNU Scheme is free software; you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation; either version 2 of the License, or (at
+your option) any later version.
+
+MIT/GNU Scheme is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with MIT/GNU Scheme; if not, write to the Free Software
+Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301,
+USA.
+
+|#
+
+;;;; Test of LETREC and LETREC*
+
+(declare (usual-integrations))
+
+(define-test 'even?/odd?-definition
+  (lambda ()
+    (define (even? x) (or (zero? x) (odd? (- x 1))))
+    (define (odd? x) (and (not (zero? x)) (even? (- x 1))))
+    (assert-true (even? 4))
+    (assert-false (odd? 4))))
+
+(define-test 'even?/odd?-letrec
+  (lambda ()
+    (letrec ((even? (lambda (x) (or (zero? x) (odd? (- x 1)))))
+	     (odd? (lambda (x) (and (not (zero? x)) (even? (- x 1))))))
+      (assert-true (even? 4))
+      (assert-false (odd? 4)))))
+
+(define-test 'even?/odd?-letrec*
+  (lambda ()
+    (letrec* ((even? (lambda (x) (or (zero? x) (odd? (- x 1)))))
+	      (odd? (lambda (x) (and (not (zero? x)) (even? (- x 1))))))
+      (assert-true (even? 4))
+      (assert-false (odd? 4)))))
+
+(define-test 'letrec-cwcc
+  (lambda ()
+    (let ((k))
+      ;; The continuation k0 WILL assign x.
+      (letrec ((x 1)
+	       (y
+		(call-with-current-continuation
+		  (lambda (k0)
+		    (set! k k0)
+		    #t))))
+	(if y
+	    (begin (set! x 2) (k #f))
+	    (assert-eqv x 1))))))
+
+(define-test 'letrec*-cwcc
+  (lambda ()
+    (let ((k))
+      ;; The continuation k0 WILL NOT assign x.
+      (letrec* ((x 1)
+		(y
+		 (call-with-current-continuation
+		   (lambda (k0)
+		     (set! k k0)
+		     #t))))
+	(if y
+	    (begin (set! x 2) (k #f))
+	    (assert-eqv x 2))))))