7491e172ea
The eopl language is now racket-based rather than mzscheme-based. This test-suite, which was originally distributed on the book's web-site has been re-written in the new language. Changes include dropping all drscheme-init.scm and top.scm files. Remaining files were renamed to use the .rkt extension and edited to use the #lang syntax (instead of modulue). Require and provide forms were changed to reflect racket's syntax instead of mzscheme's (eg, only-in vs. only). Several occurrences of one-armed ifs were changed to use when and unless. All tests have been run successfully.
80 lines
1.6 KiB
Racket
Executable File
80 lines
1.6 KiB
Racket
Executable File
#lang eopl
|
|
|
|
(require "store.rkt")
|
|
|
|
(provide (all-defined-out))
|
|
|
|
;;;;;;;;;;;;;;;; mutable pairs ;;;;;;;;;;;;;;;;
|
|
|
|
;; model a mutable pair as two consecutive locations (left and
|
|
;; right), and represent it as a reference to the first.
|
|
|
|
;; mutpair? : SchemeVal -> Bool
|
|
;; Page: 129
|
|
;;
|
|
;; Not every reference is really a mutpair, but this test is good
|
|
;; enough, because in the implicit-refs language, you
|
|
;; can't get your hands on a reference otherwise.
|
|
(define mutpair?
|
|
(lambda (v)
|
|
(reference? v)))
|
|
|
|
;; make-pair : ExpVal * ExpVal -> MutPair
|
|
;; Page: 129
|
|
(define make-pair
|
|
(lambda (val1 val2)
|
|
(let ((ref1 (newref val1)))
|
|
(let ((ref2 (newref val2)))
|
|
ref1))))
|
|
|
|
;; left : MutPair -> ExpVal
|
|
;; Page: 129
|
|
(define left
|
|
(lambda (p)
|
|
(deref p)))
|
|
|
|
;; right : MutPair -> ExpVal
|
|
;; Page: 129
|
|
(define right
|
|
(lambda (p)
|
|
(deref (+ 1 p))))
|
|
|
|
;; setleft : MutPair * ExpVal -> Unspecified
|
|
;; Page: 129
|
|
(define setleft
|
|
(lambda (p val)
|
|
(setref! p val)))
|
|
|
|
;; setright : MutPair * Expval -> Unspecified
|
|
;; Page: 129
|
|
(define setright
|
|
(lambda (p val)
|
|
(setref! (+ 1 p) val)))
|
|
|
|
|
|
|
|
|
|
;; (define mutpair? reference?) ; inaccurate
|
|
|
|
;; (define make-pair
|
|
;; (lambda (val1 val2)
|
|
;; (let ((ref1 (newref val1)))
|
|
;; (let ((ref2 (newref val2))) ; guaranteed to be ref1 + 1
|
|
;; ref1))))
|
|
|
|
;; (define left
|
|
;; (lambda (p)
|
|
;; (deref p)))
|
|
|
|
;; (define right
|
|
;; (lambda (p)
|
|
;; (deref (+ 1 p))))
|
|
|
|
;; (define setleft
|
|
;; (lambda (p val)
|
|
;; (setref! p val)))
|
|
|
|
;; (define setright
|
|
;; (lambda (p val)
|
|
;; (setref! (+ 1 p) val)))
|