Convert exercise files to .scm

1/ex-all.rkt → 1/ex-all.scm

@@ -1,5 +1,3 @@
-#lang racket
-
 ;; --------------------------------------------------
 ;; All functions are defined below. No executions take place when
 ;; run; use the REPL to test
@@ -569,4 +567,4 @@
   ((iterative-improve
     (lambda (guess) (< (abs (- (f guess) guess)) tolerance))
     f)
-   first-guess))
+   first-guess))

2/ex-1-32.rkt → 2/ex-1-32.scm

@@ -1,5 +1,3 @@
-#lang racket
-
 ;; --------------------------------------------------
 ;; Common defines used among exercises
 (define (gcd a b)
@@ -85,7 +83,7 @@
   (define (dispatch m)
     (cond ((= m 0) x)
           ((= m 1) y)
-          (else (error "Argument not 0 or 1 -- CONS" m))))
+          (else (display "Error: Argument not 0 or 1 -- CONS" m))))
   dispatch)
 
 (define (car-proc-dispatch z) (z 0))
@@ -169,7 +167,7 @@
 ;; 2.10
 (define (div-interval x y)
   (if (and (<= (lower-bound y) 0) (>= (upper-bound y) 0))
-      (error "Error: The denominator can not span 0")
+      (display "Error: The denominator can not span 0")
       (mul-interval
        x
        (make-interval (/ 1.0 (upper-bound y))

2/ex-33-52.rkt → 2/ex-33-52.scm

@@ -1,5 +1,3 @@
-#lang racket
-
 ;; Following along with reading
 (define (accumulate op initial sequence)
   (if (null? sequence)

2/ex-53-66.rkt → 2/ex-53-66.scm

@@ -1,5 +1,3 @@
-#lang racket
-
 ;; 2.53
 ;; Notepad exercises
 
@@ -71,7 +69,7 @@
                                              (make-sum (exponent exp) -1)))
           (deriv (base exp) var)))
         (else
-         (error "unknown expression type -- DERIV" exp))))
+         (display "Error: unknown expression type -- DERIV" exp))))
 
 ;; 2.57
 (define (augend-prefix a)

2/ex-67-86.rkt → 2/ex-67-86.scm

@@ -1,5 +1,3 @@
-#lang racket
-
 ;; Following along with reading
 (define (make-leaf symbol weight) (list 'leaf symbol weight))
 (define (leaf? object) (eq? (car object) 'leaf))

2/ex-87-end.rkt → 2/ex-87-end.scm

@@ -1,5 +1,3 @@
-#lang racket
-
 (define (install-polynomial-dense-package)
   ;; term-list implementation independent internal procedures
   (define (variable p) (car p))
@@ -10,7 +8,7 @@
   (define (empty-termlist) '())
   (define (rest-terms term-list) (cdr terml-list))
   (define (empty-termlist? term-list) (null? term-list))
-  p(define (make-term order coeff) (list order coeff))
+  (define (make-term order coeff) (list order coeff))
   (define (order term) (car term))
   (define (coef term) (cadr term))
 
@@ -131,7 +129,7 @@
   (define (empty-termlist) '())
   (define (rest-terms term-list) (cdr terml-list))
   (define (empty-termlist? term-list) (null? term-list))
-  p(define (make-term order coeff) (list order coeff))
+  (define (make-term order coeff) (list order coeff))
   (define (order term) (car term))
   (define (coef term) (cadr term))
 
@@ -248,7 +246,7 @@
 (define (sparse-poly? p)
   ;; If half the length of terms is less than the length of terms without
   ;; zeroes, then sparse poly is optimal
-  (if (< (/ (length p) 2) (length (filter (not zero?) p)) 2))
+  (if (< (/ (length p) 2) (length (filter (not (zero? p)) 2)))
       #t
       #f))