X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=hints%2Fcps_hint_4.mdwn;h=13add0a233fcc614866f0ba6469917938d6f4c3e;hp=9804ed62e63043c161fe02fec3b7172cb55012df;hb=413169d31f1670ffd98d2af8a962c050151cf662;hpb=d375f5d50a8cb9449932294ee76266cfb0dd36b6;ds=sidebyside

diff --git a/hints/cps_hint_4.mdwn b/hints/cps_hint_4.mdwn
index 9804ed62..13add0a2 100644
--- a/hints/cps_hint_4.mdwn
+++ b/hints/cps_hint_4.mdwn
@@ -13,11 +13,11 @@ This function is developed in *The Seasoned Schemer* pp. 165-177. It accepts a l
 	                     ; this is the only case where walk terminates naturally
 	                     [(null? l) '()]
 	                     [(atom? (car l)) (begin
-	                                        (let/cc k2
+	                                        (let/cc k2 (begin
 	                                          (set! resume k2) ; now calling resume with val will ignore val
 	                                                           ; and continue with the final line of (begin ... (walk (cdr l)))
 	                                          ; when the next line is executed, yield will be bound to k1 or k3
-	                                          (yield (car l)))
+	                                          (yield (car l))))
 	                                        ; the previous yield line will never return, but the following line will be executed when resume is called
 	                                        (walk (cdr l)))]
 	                     [else (begin
@@ -25,10 +25,10 @@ This function is developed in *The Seasoned Schemer* pp. 165-177. It accepts a l
 	                             (walk (car l))
 	                             (walk (cdr l)))]))]
 	           [next (lambda () ; next is a thunk
-	                   (let/cc k3
+	                   (let/cc k3 (begin
 	                     (set! yield k3) ; now calling yield with val will return val from the call to next
 	                     ; when the next line is executed, resume will be bound to k2
-	                     (resume 'blah)))]
+	                     (resume 'blah))))]
 	           [check (lambda (prev)
 	                    (let ([n (next)])
 	                      (cond
@@ -37,11 +37,11 @@ This function is developed in *The Seasoned Schemer* pp. 165-177. It accepts a l
 	                        ; n will fail to be an atom iff we've walked to the end of the list, and (resume 'blah) returned naturally
 	                        [else #f])))])
 	    (lambda (lst)
-	      (let ([fst (let/cc k1
+	      (let ([fst (let/cc k1 (begin
 	                   (set! yield k1) ; now calling yield with val will bind fst to val and continue with the (cond ...) block below
 	                   (walk lst)
 	                   ; the next line will be executed only when lst contains no atoms
-	                   (yield '()))])
+	                   (yield '())))])
 	        (cond
 	          [(atom? fst) (check fst)]
 	          [else #f])