(no commit message)

[lambda.git] / hints / cps_hint_3.mdwn

diff --git a/hints/cps_hint_3.mdwn b/hints/cps_hint_3.mdwn
index 845f556..fa8b373 100644 (file)
--- a/hints/cps_hint_3.mdwn
+++ b/hints/cps_hint_3.mdwn
@@ -12,16 +12,17 @@ This function is developed in *The Seasoned Schemer* pp. 84-89. It accepts an at
                              [(null? l) (k 'notfound)]
                              [(eq? (car l) a) (cdr l)]
                              [(atom? (car l)) (cons (car l) (aux (cdr l) k))]
-                             ; when (car l) exists but isn't an atom, we try to remove a from (car l)
-                             ; if we succeed we prepend the result to (cdr l) and stop
-                             [else (let ([car2 (let/cc k2
-                                                 ; calling k2 with val will bind car2 to val and continue with the (cond ...) block below
-                                                 (aux (car l) k2))])
-                                     (cond
-                                       ; if a wasn't found in (car l) then prepend (car l) to the result of removing a from (cdr l)
-                                       [(eq? car2 'notfound) (cons (car l) (aux (cdr l) k))]
-                                       ; else a was found in (car l)
-                                       [else (cons car2 (cdr l))]))]))]
+                             [else
+                              ; when (car l) exists but isn't an atom, we try to remove a from (car l)
+                              ; if we succeed we prepend the result to (cdr l) and stop
+                              (let ([car2 (let/cc k2
+                                            ; calling k2 with val will bind car2 to val and continue with the (cond ...) block below
+                                            (aux (car l) k2))])
+                                (cond
+                                  ; if a wasn't found in (car l) then prepend (car l) to the result of removing a from (cdr l)
+                                  [(eq? car2 'notfound) (cons (car l) (aux (cdr l) k))]
+                                  ; else a was found in (car l)
+                                  [else (cons car2 (cdr l))]))]))]
                     [lst2 (let/cc k1
                             ; calling k1 with val will bind lst2 to val and continue with the (cond ...) block below
                             (aux lst k1))])
@@ -30,11 +31,10 @@ This function is developed in *The Seasoned Schemer* pp. 84-89. It accepts an at
                [(eq? lst2 'notfound) lst]
                [else lst2]))))
        
-       (gamma 'a '(((a b) ()) (c (d ())))) ; ~~> '(((b) ()) (c (d ())))
-       (gamma 'a '((() (a b) ()) (c (d ())))) ; ~~> '((() (b) ()) (c (d ())))
+       (gamma 'a '(((a b) ()) (c (d ()))))       ; ~~> '(((b) ()) (c (d ())))
+       (gamma 'a '((() (a b) ()) (c (d ()))))    ; ~~> '((() (b) ()) (c (d ())))
        (gamma 'a '(() (() (a b) ()) (c (d ())))) ; ~~> '(() (() (b) ()) (c (d ())))
-       (gamma 'c '((() (a b) ()) (c (d ())))) ; ~~> '((() (a b) ()) ((d ())))
+       (gamma 'c '((() (a b) ()) (c (d ()))))    ; ~~> '((() (a b) ()) ((d ())))
        (gamma 'c '(() (() (a b) ()) (c (d ())))) ; ~~> '(() (() (a b) ()) ((d ())))
-       (gamma 'x '((() (a b) ()) (c (d ())))) ; ~~> '((() (a b) ()) (c (d ())))
-       (gamma 'x '(() (() (a b) ()) (c (d ())))) ; ~~> '(() (() (a b) ()) (c (d ())))
+       (gamma 'x '((() (a b) ()) (c (d ()))))    ; ~~> '((() (a b) ()) (c (d ())))