blob: 3c8fd21b73165a6c3d2bd95c40b5c73ddec010bb (
plain) (
blame)
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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
;
; Copyright © 2016 Keith Packard <keithp@keithp.com>
;
; This program is free software; you can redistribute it and/or modify
; it under the terms of the GNU General Public License as published by
; the Free Software Foundation, either version 2 of the License, or
; (at your option) any later version.
;
; This program is distributed in the hope that it will be useful, but
; WITHOUT ANY WARRANTY; without even the implied warranty of
; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
; General Public License for more details.
;
; Lisp code placed in ROM
; return a list containing all of the arguments
(set (quote list) (lexpr (l) l))
;
; Define a variable without returning the value
; Useful when defining functions to avoid
; having lots of output generated
;
(setq def (macro (name val rest)
(list
'progn
(list
'set
(list 'quote name)
val)
(list 'quote name)
)
)
)
;
; A slightly more convenient form
; for defining lambdas.
;
; (defun <name> (<params>) s-exprs)
;
(def defun (macro (name args exprs)
(list
def
name
(cons 'lambda (cons args exprs))
)
)
)
; basic list accessors
(defun cadr (l) (car (cdr l)))
(defun caddr (l) (car (cdr (cdr l))))
(defun nth (list n)
(cond ((= n 0) (car list))
((nth (cdr list) (1- n)))
)
)
; simple math operators
(defun 1+ (x) (+ x 1))
(defun 1- (x) (- x 1))
; define a set of local
; variables and then evaluate
; a list of sexprs
;
; (let (var-defines) sexprs)
;
; where var-defines are either
;
; (name value)
;
; or
;
; (name)
;
; e.g.
;
; (let ((x 1) (y)) (setq y (+ x 1)) y)
(def let (macro (vars exprs)
((lambda (make-names make-exprs make-nils)
;
; make the list of names in the let
;
(setq make-names (lambda (vars)
(cond (vars
(cons (car (car vars))
(make-names (cdr vars))))
)
)
)
; the set of expressions is
; the list of set expressions
; pre-pended to the
; expressions to evaluate
(setq make-exprs (lambda (vars exprs)
(cond (vars (cons
(list set
(list quote
(car (car vars))
)
(cadr (car vars))
)
(make-exprs (cdr vars) exprs)
)
)
(exprs)
)
)
)
; the parameters to the lambda is a list
; of nils of the right length
(setq make-nils (lambda (vars)
(cond (vars (cons nil (make-nils (cdr vars))))
)
)
)
; prepend the set operations
; to the expressions
(setq exprs (make-exprs vars exprs))
; build the lambda.
(cons (cons 'lambda (cons (make-names vars) exprs))
(make-nils vars)
)
)
()
()
()
)
)
)
; boolean operators
(def or (lexpr (l)
(let ((ret nil))
(while l
(cond ((setq ret (car l))
(setq l nil))
((setq l (cdr l)))))
ret
)
)
)
; execute to resolve macros
(or nil t)
(def and (lexpr (l)
(let ((ret t))
(while l
(cond ((setq ret (car l))
(setq l (cdr l)))
((setq ret (setq l nil)))
)
)
ret
)
)
)
; execute to resolve macros
(and t nil)
|
