From 3e72ce494ad9e17eaddfe0f054decf6cab590ac9 Mon Sep 17 00:00:00 2001
From: sforman <sforman@hushmail.com>
Date: Fri, 20 Oct 2023 22:16:21 -0700
Subject: [PATCH] minor edits

---
 implementations/scheme-chicken/joy.scm | 21 ++++++++++-----------
 1 file changed, 10 insertions(+), 11 deletions(-)

diff --git a/implementations/scheme-chicken/joy.scm b/implementations/scheme-chicken/joy.scm
index 78df1c1..44c6881 100644
--- a/implementations/scheme-chicken/joy.scm
+++ b/implementations/scheme-chicken/joy.scm
@@ -257,8 +257,7 @@
     (if (not (eof-object? text))
       (receive (stack dict)
         (handle-exceptions exn
-          (begin (display exn) (newline)
-            (values stack0 dict0))
+          (begin (display exn) (newline) (values stack0 dict0))
           (joy stack0 (text->expression text) dict0))
         (print (joy-expression->string (reverse stack)))
         (main-loop stack dict))
@@ -278,18 +277,18 @@
 
 ; Importing srfi-67 did not actually make available symbol-compare.  Boo!
 
-(define (symbol<? a b) (string<? (symbol->string a) (symbol->string b)))
+;(define (symbol<? a b) (string<? (symbol->string a) (symbol->string b)))
 
 ; a BTree is a four-tuple of (name value left right) | ()
 
-(define (btree-get key btree)
-  (match btree
-    (() (abort "Key not found."))
-    ((k value left right)
-      (if (eq? key k)
-        value
-        (btree-get key (if (symbol<? key k) left right))))
-    (_ (abort "Not a BTree."))))
+;(define (btree-get key btree)
+;  (match btree
+;    (() (abort "Key not found."))
+;    ((k value left right)
+;      (if (eq? key k)
+;        value
+;        (btree-get key (if (symbol<? key k) left right))))
+;    (_ (abort "Not a BTree."))))