-
Notifications
You must be signed in to change notification settings - Fork 0
/
hw5.rkt
151 lines (126 loc) · 5.82 KB
/
hw5.rkt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
;; Programming Languages, Homework 5
#lang racket
(provide (all-defined-out)) ;; so we can put tests in a second file
;; definition of structures for MUPL programs - Do NOT change
(struct var (string) #:transparent) ;; a variable, e.g., (var "foo")
(struct int (num) #:transparent) ;; a constant number, e.g., (int 17)
(struct add (e1 e2) #:transparent) ;; add two expressions
(struct ifgreater (e1 e2 e3 e4) #:transparent) ;; if e1 > e2 then e3 else e4
(struct fun (nameopt formal body) #:transparent) ;; a recursive(?) 1-argument function
(struct call (funexp actual) #:transparent) ;; function call
(struct mlet (var e body) #:transparent) ;; a local binding (let var = e in body)
(struct apair (e1 e2) #:transparent) ;; make a new pair
(struct fst (e) #:transparent) ;; get first part of a pair
(struct snd (e) #:transparent) ;; get second part of a pair
(struct aunit () #:transparent) ;; unit value -- good for ending a list
(struct isaunit (e) #:transparent) ;; evaluate to 1 if e is unit else 0
;; a closure is not in "source" programs but /is/ a MUPL value; it is what functions evaluate to
(struct closure (env fun) #:transparent)
;; Problem 1
;; CHANGE (put your solutions here)
(define (racketlist->mupllist xs)
(if (null? xs) (aunit) (apair (car xs) (racketlist->mupllist (cdr xs)))))
;; Problem 2
(define (mupllist->racketlist xs)
(if (equal? (aunit) xs) null (cons (apair-e1 xs) (mupllist->racketlist (apair-e2 xs)))))
;; lookup a variable in an environment
;; Do NOT change this function
(define (envlookup env str)
(cond [(null? env) (error "unbound variable during evaluation" str)]
[(equal? (car (car env)) str) (cdr (car env))]
[#t (envlookup (cdr env) str)]))
;; Do NOT change the two cases given to you.
;; DO add more cases for other kinds of MUPL expressions.
;; We will test eval-under-env by calling it directly even though
;; "in real life" it would be a helper function of eval-exp.
(define (eval-under-env e env)
(cond [(var? e)
(envlookup env (var-string e))]
[(add? e)
(let ([v1 (eval-under-env (add-e1 e) env)]
[v2 (eval-under-env (add-e2 e) env)])
(if (and (int? v1)
(int? v2))
(int (+ (int-num v1)
(int-num v2)))
(error "MUPL addition applied to non-number")))]
;; CHANGE add more cases here
[(int? e) e]
[(ifgreater? e)
(let ([v1 (eval-under-env (ifgreater-e1 e) env)]
[v2 (eval-under-env (ifgreater-e2 e) env)])
(if (and (int? v1)
(int? v2))
(if (> (int-num v1) (int-num v2))
(eval-under-env (ifgreater-e3 e) env)
(eval-under-env (ifgreater-e4 e) env))
(error "MUPL ifgreater-e1-e2 applied to non-number")))]
[(fun? e) (closure env e)]
[(call? e)
(let ([fn (eval-under-env (call-funexp e) env)])
(if (closure? fn)
(let ( [tmp (closure-fun fn)]
[env-now (closure-env fn)]
[called (eval-under-env (call-actual e) env)])
(if (fun-nameopt tmp)
(let ([env3 (cons (cons (fun-nameopt tmp) fn) (cons (cons (fun-formal tmp) called) env-now))])
(eval-under-env (fun-body tmp) env3))
(let ([env2 (cons (cons (fun-formal tmp) called) env-now)])
(eval-under-env (fun-body tmp) env2))))
(error "MUPL call e first arfument not a closure")))]
[(mlet? e)
(letrec ([ans (eval-under-env (mlet-e e) env)]
[env2 (cons (cons (mlet-var e) ans) env)])
(eval-under-env (mlet-body e) env2))]
[(apair? e)
(apair (eval-under-env (apair-e1 e) env)
(eval-under-env (apair-e2 e) env))]
[(fst? e)
(let ([v (eval-under-env (fst-e e) env)])
(if (apair? v) (apair-e1 v) (error "MUPL fst applied to pair")))]
[(snd? e)
(let ([v (eval-under-env (snd-e e) env)])
(if (apair? v) (apair-e2 v) (error "MUPL fst applied to pair")))]
[(aunit? e) e]
[(isaunit? e)
(if (aunit? (eval-under-env (isaunit-e e) env)) (int 1) (int 0))]
[(closure? e) e]
[#t (error (format "bad MUPL expression: ~v" e))]))
;; Do NOT change
(define (eval-exp e)
(eval-under-env e null))
;; Problem 3
(define (ifaunit e1 e2 e3) (ifgreater (isaunit e1) (int 0) e2 e3))
(define (mlet* lstlst e2)
(if (null? lstlst)
e2
(mlet (car(car lstlst)) (cdr(car lstlst)) (mlet* (cdr lstlst) e2))))
(define (ifeq e1 e2 e3 e4)
(mlet "_x" e1
(mlet "_y" e2
(ifgreater (var "_x") (var "_y") e4 (ifgreater (var "_y") (var "_x") e4 e3)))))
;; Problem 4
(define mupl-map
(fun #f "fun"
(fun "mapfun" "lst"
(ifaunit (var "lst")
(aunit) (apair (call(var "fun") (fst(var "lst")))
(call (var "mapfun")(snd (var "lst"))))))))
(define mupl-mapAddN
(mlet "map" mupl-map
(fun #f "incr"
(call (var "map")
(fun #f "x"
(add (var "incr") (var "x")))))))
;; Challenge Problem
(struct fun-challenge (nameopt formal body freevars) #:transparent) ;; a recursive(?) 1-argument function
;; We will test this function directly, so it must do
;; as described in the assignment
(define (compute-free-vars e) "CHANGE")
;; Do NOT share code with eval-under-env because that will make
;; auto-grading and peer assessment more difficult, so
;; copy most of your interpreter here and make minor changes
(define (eval-under-env-c e env) "CHANGE")
;; Do NOT change this
(define (eval-exp-c e)
(eval-under-env-c (compute-free-vars e) null))