Commit | Line | Data |
---|---|---|
0f4ca9d1 JM |
1 | # The Make-A-Lisp Process |
2 | ||
3 | So you want to write a Lisp interpreter? Welcome! | |
4 | ||
5 | The goal of the Make-A-Lisp project is to make it easy to write your | |
6 | own Lisp interpreter without sacrificing those many "Aha!" moments | |
7 | that come from ascending the McCarthy mountain. When you reach the peak | |
8 | of this particular mountain, you will have an interpreter for the mal | |
9 | Lisp language that is powerful enough to be self-hosting, meaning it | |
10 | will be able to run a mal interpreter written in mal itself. | |
11 | ||
12 | So jump right in (er ... start the climb)! | |
13 | ||
dc791440 DM |
14 | - [Pick a language](#pick-a-language) |
15 | - [Getting started](#getting-started) | |
16 | - [General hints](#general-hints) | |
17 | - [The Make-A-Lisp Process](#the-make-a-lisp-process-1) | |
18 | - [Step 0: The REPL](#step-0-the-repl) | |
19 | - [Step 1: Read and Print](#step-1-read-and-print) | |
20 | - [Step 2: Eval](#step-2-eval) | |
21 | - [Step 3: Environments](#step-3-environments) | |
22 | - [Step 4: If Fn Do](#step-4-if-fn-do) | |
23 | - [Step 5: Tail call optimization](#step-5-tail-call-optimization) | |
24 | - [Step 6: Files, Mutation, and Evil](#step-6-files-mutation-and-evil) | |
25 | - [Step 7: Quoting](#step-7-quoting) | |
26 | - [Step 8: Macros](#step-8-macros) | |
27 | - [Step 9: Try](#step-9-try) | |
28 | - [Step A: Metadata, Self-hosting and Interop](#step-a-metadata-self-hosting-and-interop) | |
29 | ||
30 | ||
0f4ca9d1 JM |
31 | ## Pick a language |
32 | ||
33 | You might already have a language in mind that you want to use. | |
34 | Technically speaking, mal can be implemented in any sufficiently | |
c10dcb94 | 35 | complete programming language (i.e. Turing complete), however, there are a few |
0f4ca9d1 JM |
36 | language features that can make the task MUCH easier. Here are some of |
37 | them in rough order of importance: | |
38 | ||
39 | * A sequential compound data structure (e.g. arrays, lists, | |
40 | vectors, etc) | |
41 | * An associative compound data structure (e.g. a dictionary, | |
42 | hash-map, associative array, etc) | |
43 | * Function references (first class functions, function pointers, | |
44 | etc) | |
45 | * Real exception handling (try/catch, raise, throw, etc) | |
46 | * Variable argument functions (variadic, var args, splats, apply, etc) | |
47 | * Function closures | |
48 | * PCRE regular expressions | |
49 | ||
50 | In addition, the following will make your task especially easy: | |
51 | ||
bf518367 JM |
52 | * Dynamic typing / boxed types (specifically, the ability to store |
53 | different data types in the sequential and associative structures | |
54 | and the language keeps track of the type for you) | |
0f4ca9d1 JM |
55 | * Compound data types support arbitrary runtime "hidden" data |
56 | (metadata, metatables, dynamic fields attributes) | |
57 | ||
58 | Here are some examples of languages that have all of the above | |
59 | features: JavaScript, Ruby, Python, Lua, R, Clojure. | |
60 | ||
cf70df1f JM |
61 | Michael Fogus has some great blog posts on interesting but less well |
62 | known languages and many of the languages on his lists do not yet have | |
63 | any mal implementations: | |
64 | * http://blog.fogus.me/2011/08/14/perlis-languages/ | |
65 | * http://blog.fogus.me/2011/10/18/programming-language-development-the-past-5-years/ | |
66 | ||
0f4ca9d1 JM |
67 | Many of the most popular languages already have Mal implementations. |
68 | However, this should not discourage you from creating your own | |
69 | implementation in a language that already has one. However, if you go | |
70 | this route, I suggest you avoid referring to the existing | |
71 | implementations (i.e. "cheating") to maximize your learning experience | |
72 | instead of just borrowing mine. On the other hand, if your goal is to | |
73 | add new implementations to mal as efficiently as possible, then you | |
74 | SHOULD find the most similar target language implementation and refer | |
75 | to it frequently. | |
76 | ||
bf518367 JM |
77 | If you want a fairly long list of programming languages with an |
78 | approximate measure of popularity, try the [Programming Language | |
79 | Popularity Chart](http://langpop.corger.nl/) | |
80 | ||
0f4ca9d1 JM |
81 | |
82 | ## Getting started | |
83 | ||
84 | * Install your chosen language interpreter/compiler, language package | |
85 | manager and build tools (if applicable) | |
86 | ||
87 | * Fork the mal repository on github and then clone your forked | |
88 | repository: | |
89 | ``` | |
90 | git clone git@github.com:YOUR_NAME/mal.git | |
91 | cd mal | |
92 | ``` | |
93 | ||
fc03712f EC |
94 | * Make a new directory for your implementation. For example, if your |
95 | language is called "quux": | |
0f4ca9d1 JM |
96 | ``` |
97 | mkdir quux | |
98 | ``` | |
99 | ||
100 | * Modify the top level Makefile to allow the tests to be run against | |
101 | your implementation. For example, if your language is named "quux" | |
102 | and uses "qx" as the file extension, then make the following | |
103 | 3 modifications to Makefile: | |
104 | ``` | |
105 | IMPLS = ... quux ... | |
106 | ... | |
107 | quux_STEP_TO_PROG = mylang/$($(1)).qx | |
108 | ... | |
109 | quux_RUNSTEP = ../$(2) $(3) | |
110 | ``` | |
111 | ||
112 | This allows you to run tests against your implementation like this: | |
113 | ``` | |
e5737b08 | 114 | make "test^quux^stepX" |
0f4ca9d1 JM |
115 | ``` |
116 | ||
396d869e JM |
117 | TODO: If your implementation language is a compiled language, then you |
118 | should also add a Makefile at the top level of your implementation | |
5c052692 WH |
119 | directory. |
120 | ||
121 | Your Makefile will define how to build the files pointed to by the | |
396d869e JM |
122 | quux_STEP_TO_PROG macro. The top-level Makefile will attempt to build |
123 | those targets before running tests. If it is a scripting | |
124 | language/uncompiled, then no Makefile is necessary because | |
125 | quux_STEP_TO_PROG will point to a source file that already exists and | |
126 | does not need to be compiled/built. | |
127 | ||
0f4ca9d1 JM |
128 | |
129 | ## General hints | |
130 | ||
131 | Stackoverflow and Google are your best friends. Modern polyglot | |
132 | developers do not memorize dozens of programming languages. Instead, | |
133 | they learn the peculiar terminology used with each language and then | |
134 | use this to search for their answers. | |
135 | ||
136 | Here are some other resources where multiple languages are | |
137 | compared/described: | |
138 | * http://learnxinyminutes.com/ | |
139 | * http://hyperpolyglot.org/ | |
140 | * http://rosettacode.org/ | |
334a71b6 | 141 | * http://rigaux.org/language-study/syntax-across-languages/ |
0f4ca9d1 JM |
142 | |
143 | Do not let yourself be bogged down by specific problems. While the | |
144 | make-a-lisp process is structured as a series of steps, the reality is | |
145 | that building a lisp interpreter is more like a branching tree. If you | |
146 | get stuck on tail call optimization, or hash-maps, move on to other | |
147 | things. You will often have a stroke of inspiration for a problem as | |
148 | you work through other functionality. I have tried to structure this | |
45a8b3ca JM |
149 | guide and the tests to make clear which things can be deferred until |
150 | later. | |
151 | ||
152 | An aside on deferrable/optional bits: when you run the tests for | |
153 | a given step, the last tests are often marked with an "optional" | |
154 | header. This indicates that these are tests for functionality that is | |
155 | not critical to finish a basic mal implementation. Many of the steps | |
156 | in this process guide have a "Deferrable" section, however, it is not | |
157 | quite the same meaning. Those sections include the functionality that | |
158 | is marked as optional in the tests, but they also include | |
0f4ca9d1 JM |
159 | functionality that becomes mandatory at a later step. In other words, |
160 | this is a "make your own Lisp adventure". | |
161 | ||
162 | Use test driven development. Each step of the make-a-lisp process has | |
163 | a bunch of tests associated with it and there is an easy script to run | |
164 | all the tests for a specific step in the process. Pick a failing test, | |
165 | fix it, repeat until all the tests for that step pass. | |
166 | ||
5c052692 WH |
167 | ## Reference Code |
168 | ||
0f4ca9d1 JM |
169 | The `process` directory contains abbreviated pseudocode and |
170 | architecture images for each step of the make-a-lisp process. Use | |
171 | a textual diff/comparison tool to compare the previous pseudocode step | |
172 | with the one you are working on. The architecture images have changes | |
173 | from the previous step highlighted in red. | |
174 | ||
daa1cf3f JM |
175 | If you get completely stuck and are feeling like giving up, then you |
176 | should "cheat" by referring to the same step or functionality in | |
177 | a existing implementation language. You are here to learn, not to take | |
178 | a test, so do not feel bad about it. Okay, you should feel a little | |
179 | bit bad about it. | |
0f4ca9d1 JM |
180 | |
181 | ||
182 | ## The Make-A-Lisp Process | |
183 | ||
184 | In the steps that follow the name of the target language is "quux" and | |
185 | the file extension for that language is "qx". | |
186 | ||
187 | ||
188 | <a name="step0"></a> | |
189 | ||
190 | ### Step 0: The REPL | |
191 | ||
192 | ![step0_repl architecture](step0_repl.png) | |
193 | ||
194 | This step is basically just creating a skeleton of your interpreter. | |
195 | ||
196 | * Create a `step0_repl.qx` file in `quux/`. | |
197 | ||
198 | * Add the 4 trivial functions `READ`, `EVAL`, `PRINT`, and `rep` | |
199 | (read-eval-print). `READ`, `EVAL`, and `PRINT` are basically just | |
200 | stubs that return their first parameter (a string if your target | |
201 | language is a statically typed) and `rep` calls them in order | |
202 | passing the return to the input of the next. | |
203 | ||
58ba5af4 JM |
204 | * Add a main loop that repeatedly prints a prompt (needs to be |
205 | "user> " for later tests to pass), gets a line of input from the | |
206 | user, calls `rep` with that line of input, and then prints out the | |
207 | result from `rep`. It should also exit when you send it an EOF | |
208 | (often Ctrl-D). | |
0f4ca9d1 JM |
209 | |
210 | * If you are using a compiled (ahead-of-time rather than just-in-time) | |
211 | language, then create a Makefile (or appropriate project definition | |
212 | file) in your directory. | |
213 | ||
daa1cf3f JM |
214 | It is time to run your first tests. This will check that your program |
215 | does input and output in a way that can be captured by the test | |
216 | harness. Go to the top level and run the following: | |
217 | ``` | |
e5737b08 | 218 | make "test^quux^step0" |
daa1cf3f | 219 | ``` |
0f4ca9d1 JM |
220 | |
221 | Add and then commit your new `step0_repl.qx` and `Makefile` to git. | |
222 | ||
223 | Congratulations! You have just completed the first step of the | |
224 | make-a-lisp process. | |
225 | ||
226 | ||
bd62ff74 | 227 | #### Optional: |
0f4ca9d1 JM |
228 | |
229 | * Add full line editing and command history support to your | |
230 | interpreter REPL. Many languages have a library/module that provide | |
231 | line editing support. Another option if your language supports it is | |
232 | to use an FFI (foreign function interface) to load and call directly | |
94a954f5 | 233 | into GNU readline, editline, or linenoise library. Add line |
0f4ca9d1 JM |
234 | editing interface code to `readline.qx` |
235 | ||
236 | ||
237 | <a name="step1"></a> | |
238 | ||
239 | ### Step 1: Read and Print | |
240 | ||
241 | ![step1_read_print architecture](step1_read_print.png) | |
242 | ||
243 | In this step, your interpreter will "read" the string from the user | |
244 | and parse it into an internal tree data structure (an abstract syntax | |
245 | tree) and then take that data structure and "print" it back to | |
246 | a string. | |
247 | ||
248 | In non-lisp languages, this step (called "lexing and parsing") can be | |
249 | one of the most complicated parts of the compiler/interpreter. In | |
250 | Lisp, the data structure that you want in memory is basically | |
251 | represented directly in the code that the programmer writes | |
252 | (homoiconicity). | |
253 | ||
254 | For example, if the string is "(+ 2 (* 3 4))" then the read function | |
255 | will process this into a tree structure that looks like this: | |
256 | ``` | |
257 | List | |
258 | / | \ | |
259 | / | \ | |
260 | / | \ | |
261 | Sym:+ Int:2 List | |
262 | / | \ | |
263 | / | \ | |
264 | / | \ | |
265 | Sym:* Int:3 Int:4 | |
266 | ``` | |
267 | ||
268 | Each left paren and its matching right paren (lisp "sexpr") becomes | |
269 | a node in the tree and everything else becomes a leaf in the tree. | |
270 | ||
271 | If you can find code for an implementation of a JSON encoder/decoder | |
272 | in your target language then you can probably just borrow and modify | |
273 | that and be 75% of the way done with this step. | |
274 | ||
275 | The rest of this section is going to assume that you are not starting | |
276 | from an existing JSON encoder/decoder, but that you do have access to | |
277 | a Perl compatible regular expressions (PCRE) module/library. You can | |
278 | certainly implement the reader using simple string operations, but it | |
279 | is more involved. The `make`, `ps` (postscript) and Haskell | |
280 | implementations have examples of a reader/parser without using regular | |
281 | expression support. | |
282 | ||
283 | * Copy `step0_repl.qx` to `step1_read_print.qx`. | |
284 | ||
285 | * Add a `reader.qx` file to hold functions related to the reader. | |
286 | ||
287 | * If the target language has objects types (OOP), then the next step | |
288 | is to create a simple stateful Reader object in `reader.qx`. This | |
289 | object will store the tokens and a position. The Reader object will | |
d717d991 | 290 | have two methods: `next` and `peek`. `next` returns the token at |
0f4ca9d1 JM |
291 | the current position and increments the position. `peek` just |
292 | returns the token at the current position. | |
293 | ||
294 | * Add a function `read_str` in `reader.qx`. This function | |
295 | will call `tokenizer` and then create a new Reader object instance | |
296 | with the tokens. Then it will call `read_form` with the Reader | |
297 | instance. | |
298 | ||
299 | * Add a function `tokenizer` in `reader.qx`. This function will take | |
2315fd53 | 300 | a single string and return an array/list |
0f4ca9d1 JM |
301 | of all the tokens (strings) in it. The following regular expression |
302 | (PCRE) will match all mal tokens. | |
303 | ``` | |
304 | [\s,]*(~@|[\[\]{}()'`~^@]|"(?:\\.|[^\\"])*"|;.*|[^\s\[\]{}('"`,;)]*) | |
305 | ``` | |
cfdf00cc OR |
306 | * For each match captured within the parenthesis starting at char 6 of the |
307 | regular expression a new token will be created. | |
308 | ||
309 | * `[\s,]*`: Matches any number of whitespaces or commas. This is not captured | |
310 | so it will be ignored and not tokenized. | |
311 | ||
312 | * `~@`: Captures the special two-characters `~@` (tokenized). | |
313 | ||
314 | * ```[\[\]{}()'`~^@]```: Captures any special single character, one of | |
315 | ```[]{}'`~^@``` (tokenized). | |
316 | ||
317 | * `"(?:\\.|[^\\"])*"`: Starts capturing at a double-quote and stops at the | |
318 | next double-quote unless it was proceeded by a backslash in which case it | |
a85b8454 | 319 | includes it until the next double-quote (tokenized). |
cfdf00cc OR |
320 | |
321 | * `;.*`: Captures any sequence of characters starting with `;` (tokenized). | |
322 | ||
323 | * ```[^\s\[\]{}('"`,;)]*```: Captures a sequence of zero or more non special | |
324 | characters (e.g. symbols, numbers, "true", "false", and "nil") and is sort | |
325 | of the inverse of the one above that captures special characters (tokenized). | |
0f4ca9d1 JM |
326 | |
327 | * Add the function `read_form` to `reader.qx`. This function | |
328 | will peek at the first token in the Reader object and switch on the | |
329 | first character of that token. If the character is a left paren then | |
330 | `read_list` is called with the Reader object. Otherwise, `read_atom` | |
331 | is called with the Reader Object. The return value from `read_form` | |
332 | is a mal data type. If your target language is statically typed then | |
333 | you will need some way for `read_form` to return a variant or | |
334 | subclass type. For example, if your language is object oriented, | |
2315fd53 | 335 | then you can define a top level MalType (in `types.qx`) that all |
0f4ca9d1 JM |
336 | your mal data types inherit from. The MalList type (which also |
337 | inherits from MalType) will contains a list/array of other MalTypes. | |
338 | If your language is dynamically typed then you can likely just | |
339 | return a plain list/array of other mal types. | |
340 | ||
341 | * Add the function `read_list` to `reader.qx`. This function will | |
342 | repeatedly call `read_form` with the Reader object until it | |
343 | encounters a ')' token (if it reach EOF before reading a ')' then | |
344 | that is an error). It accumulates the results into a List type. If | |
345 | your language does not have a sequential data type that can hold mal | |
346 | type values you may need to implement one (in `types.qx`). Note | |
347 | that `read_list` repeatedly calls `read_form` rather than | |
a85b8454 | 348 | `read_atom`. This mutually recursive definition between `read_list` |
0f4ca9d1 JM |
349 | and `read_form` is what allows lists to contain lists. |
350 | ||
351 | * Add the function `read_atom` to `reader.qx`. This function will | |
352 | look at the contents of the token and return the appropriate scalar | |
353 | (simple/single) data type value. Initially, you can just implement | |
354 | numbers (integers) and symbols . This will allow you to proceed | |
355 | through the next couple of steps before you will need to implement | |
356 | the other fundamental mal types: nil, true, false, and string. The | |
357 | remaining mal types: keyword, vector, hash-map, and atom do not | |
358 | need to be implemented until step 9 (but can be implemented at any | |
359 | point between this step and that). BTW, symbols types are just an | |
360 | object that contains a single string name value (some languages have | |
361 | symbol types already). | |
362 | ||
363 | * Add a file `printer.qx`. This file will contain a single function | |
364 | `pr_str` which does the opposite of `read_str`: take a mal data | |
365 | structure and return a string representation of it. But `pr_str` is | |
366 | much simpler and is basically just a switch statement on the type of | |
367 | the input object: | |
368 | ||
369 | * symbol: return the string name of the symbol | |
370 | * number: return the number as a string | |
371 | * list: iterate through each element of the list calling `pr_str` on | |
372 | it, then join the results with a space separator, and surround the | |
373 | final result with parens | |
374 | ||
375 | * Change the `READ` function in `step1_read_print.qx` to call | |
376 | `reader.read_str` and the `PRINT` function to call `printer.pr_str`. | |
377 | `EVAL` continues to simply return its input but the type is now | |
378 | a mal data type. | |
379 | ||
380 | You now have enough hooked up to begin testing your code. You can | |
381 | manually try some simple inputs: | |
382 | * `123` -> `123` | |
383 | * ` 123 ` -> `123` | |
384 | * `abc` -> `abc` | |
385 | * ` abc ` -> `abc` | |
386 | * `(123 456)` -> `(123 456)` | |
387 | * `( 123 456 789 ) ` -> `(123 456 789)` | |
6a767b0d | 388 | * `( + 2 (* 3 4) ) ` -> `(+ 2 (* 3 4))` |
0f4ca9d1 JM |
389 | |
390 | To verify that your code is doing more than just eliminating extra | |
391 | spaces (and not failing), you can instrument your `reader.qx` functions. | |
392 | ||
393 | Once you have gotten past those simple manual tests, it is time to run | |
394 | the full suite of step 1 tests. Go to the top level and run the | |
395 | following: | |
396 | ``` | |
e5737b08 | 397 | make "test^quux^step1" |
0f4ca9d1 JM |
398 | ``` |
399 | ||
400 | Fix any test failures related to symbols, numbers and lists. | |
401 | ||
402 | Depending on the functionality of your target language, it is likely | |
403 | that you have now just completed one of the most difficult steps. It | |
404 | is down hill from here. The remaining steps will probably be easier | |
405 | and each step will give progressively more bang for the buck. | |
406 | ||
45a8b3ca | 407 | #### Deferrable: |
0f4ca9d1 JM |
408 | |
409 | ||
410 | * Add error checking to your reader functions to make sure parens | |
411 | are properly matched. Catch and print these errors in your main | |
412 | loop. If your language does not have try/catch style bubble up | |
413 | exception handling, then you will need to add explicit error | |
414 | handling to your code to catch and pass on errors without crashing. | |
415 | ||
416 | * Add support for the other basic data type to your reader and printer | |
417 | functions: string, nil, true, and false. These become mandatory at | |
8d78bc26 JM |
418 | step 4. When a string is read, the following transformations are |
419 | applied: a backslash followed by a doublequote is translated into | |
420 | a plain doublequote character, a backslash followed by "n" is | |
421 | translated into a newline, and a backslash followed by another | |
422 | backslash is translated into a single backslash. To properly print | |
423 | a string (for step 4 string functions), the `pr_str` function needs | |
424 | another parameter called `print_readably`. When `print_readably` is | |
425 | true, doublequotes, newlines, and backslashes are translated into | |
426 | their printed representations (the reverse of the reader). The | |
427 | `PRINT` function in the main program should call `pr_str` with | |
428 | print_readably set to true. | |
0f4ca9d1 JM |
429 | |
430 | * Add support for the other mal types: keyword, vector, hash-map, and | |
2345a3da JM |
431 | atom. |
432 | * keyword: a keyword is a token that begins with a colon. A keyword | |
433 | can just be stored as a string with special unicode prefix like | |
434 | 0x29E (or char 0xff/127 if the target language does not have good | |
435 | unicode support) and the printer translates strings with that | |
436 | prefix back to the keyword representation. This makes it easy to | |
437 | use keywords as hash map keys in most languages. You can also | |
438 | store keywords as a unique data type, but you will need to make | |
439 | sure they can be used as hash map keys (which may involve doing | |
440 | a similar prefixed translation anyways). | |
441 | * vector: a vector can be implemented with same underlying | |
442 | type as a list as long as there is some mechanism to keep track of | |
443 | the difference. You can use the same reader function for both | |
444 | lists and vectors by adding parameters for the starting and ending | |
445 | tokens. | |
446 | * hash-map: a hash-map is an associative data structure that maps | |
447 | strings to other mal values. If you implement keywords as prefixed | |
448 | strings, then you only need a native associative data structure | |
449 | which supports string keys. Clojure allows any value to be a hash | |
450 | map key, but the base functionality in mal is to support strings | |
451 | and keyword keys. Because of the representation of hash-maps as | |
452 | an alternating sequence of keys and values, you can probably use | |
453 | the same reader function for hash-maps as lists and vectors with | |
454 | parameters to indicate the starting and ending tokens. The odd | |
455 | tokens are then used for keys with the corresponding even tokens | |
456 | as the values. | |
457 | ||
458 | * Add support for reader macros which are forms that are | |
459 | transformed into other forms during the read phase. Refer to | |
460 | `tests/step1_read_print.mal` for the form that these macros should | |
461 | take (they are just simple transformations of the token stream). | |
0f4ca9d1 JM |
462 | |
463 | * Add comment support to your reader. The tokenizer should ignore | |
464 | tokens that start with ";". Your `read_str` function will need to | |
465 | properly handle when the tokenizer returns no values. The simplest | |
466 | way to do this is to return `nil` mal value. A cleaner option (that | |
467 | does not print `nil` at the prompt is to throw a special exception | |
468 | that causes the main loop to simply continue at the beginning of the | |
469 | loop without calling `rep`. | |
470 | ||
471 | ||
472 | <a name="step2"></a> | |
473 | ||
474 | ### Step 2: Eval | |
475 | ||
476 | ![step2_eval architecture](step2_eval.png) | |
477 | ||
478 | In step 1 your mal interpreter was basically just a way to validate | |
479 | input and eliminate extraneous white space. In this step you will turn | |
480 | your interpreter into a simple number calculator by adding | |
481 | functionality to the evaluator (`EVAL`). | |
482 | ||
483 | Compare the pseudocode for step 1 and step 2 to get a basic idea of | |
484 | the changes that will be made during this step: | |
485 | ``` | |
486 | diff -urp ../process/step1_read_print.txt ../process/step2_eval.txt | |
487 | ``` | |
488 | ||
489 | * Copy `step1_read_print.qx` to `step2_eval.qx`. | |
490 | ||
491 | * Define a simple initial REPL environment. This environment is an | |
492 | associative structure that maps symbols (or symbol names) to | |
493 | numeric functions. For example, in python this would look something | |
494 | like this: | |
495 | ``` | |
496 | repl_env = {'+': lambda a,b: a+b, | |
497 | '-': lambda a,b: a-b, | |
498 | '*': lambda a,b: a*b, | |
499 | '/': lambda a,b: int(a/b)} | |
500 | ``` | |
501 | ||
502 | * Modify the `rep` function to pass the REPL environment as the second | |
503 | parameter for the `EVAL` call. | |
504 | ||
505 | * Create a new function `eval_ast` which takes `ast` (mal data type) | |
506 | and an associative structure (the environment from above). | |
507 | `eval_ast` switches on the type of `ast` as follows: | |
508 | ||
509 | * symbol: lookup the symbol in the environment structure and return | |
510 | the value or raise an error no value is found | |
511 | * list: return a new list that is the result of calling `EVAL` on | |
512 | each of the members of the list | |
513 | * otherwise just return the original `ast` value | |
514 | ||
515 | * Modify `EVAL` to check if the first parameter `ast` is a list. | |
516 | * `ast` is not a list: then return the result of calling `eval_ast` | |
517 | on it. | |
518 | * `ast` is a list: call `eval_ast` to get a new evaluated list. Take | |
519 | the first item of the evaluated list and call it as function using | |
520 | the rest of the evaluated list as its arguments. | |
521 | ||
522 | If your target language does not have full variable length argument | |
523 | support (e.g. variadic, vararg, splats, apply) then you will need to | |
524 | pass the full list of arguments as a single parameter and split apart | |
525 | the individual values inside of every mal function. This is annoying, | |
526 | but workable. | |
527 | ||
528 | The process of taking a list and invoking or executing it to return | |
529 | something new is known in Lisp as the "apply" phase. | |
530 | ||
531 | Try some simple expressions: | |
532 | ||
533 | * `(+ 2 3)` -> `5` | |
534 | * `(+ 2 (* 3 4))` -> `14` | |
535 | ||
536 | The most likely challenge you will encounter is how to properly call | |
537 | a function references using an arguments list. | |
538 | ||
539 | Now go to the top level, run the step 2 tests and fix the errors. | |
540 | ``` | |
e5737b08 | 541 | make "test^quux^step2" |
0f4ca9d1 JM |
542 | ``` |
543 | ||
544 | You now have a simple prefix notation calculator! | |
545 | ||
546 | ||
547 | <a name="step3"></a> | |
548 | ||
549 | ### Step 3: Environments | |
550 | ||
551 | ![step3_env architecture](step3_env.png) | |
552 | ||
553 | In step 2 you were already introduced to REPL environment (`repl_env`) | |
554 | where the basic numeric functions were stored and looked up. In this | |
555 | step you will add the ability to create new environments (`let*`) and | |
daa1cf3f | 556 | modify existing environments (`def!`). |
0f4ca9d1 JM |
557 | |
558 | A Lisp environment is an associative data structure that maps symbols (the | |
559 | keys) to values. But Lisp environments have an additional important | |
560 | function: they can refer to another environment (the outer | |
561 | environment). During environment lookups, if the current environment | |
562 | does not have the symbol, the lookup continues in the outer | |
563 | environment, and continues this way until the symbol is either found, | |
564 | or the outer environment is `nil` (the outermost environment in the | |
565 | chain). | |
566 | ||
567 | Compare the pseudocode for step 2 and step 3 to get a basic idea of | |
568 | the changes that will be made during this step: | |
569 | ``` | |
570 | diff -urp ../process/step2_eval.txt ../process/step3_env.txt | |
571 | ``` | |
572 | ||
d9c020b0 | 573 | * Copy `step2_eval.qx` to `step3_env.qx`. |
0f4ca9d1 JM |
574 | |
575 | * Create `env.qx` to hold the environment definition. | |
576 | ||
577 | * Define an `Env` object that is instantiated with a single `outer` | |
578 | parameter and starts with an empty associative data structure | |
579 | property `data`. | |
580 | ||
581 | * Define three methods for the Env object: | |
582 | * set: takes a symbol key and a mal value and adds to the `data` | |
583 | structure | |
584 | * find: takes a symbol key and if the current environment contains | |
585 | that key then return the environment. If no key is found and outer | |
586 | is not `nil` then call find (recurse) on the outer environment. | |
587 | * get: takes a symbol key and uses the `find` method to locate the | |
588 | environment with the key, then returns the matching value. If no | |
589 | key is found up the outer chain, then throws/raises a "not found" | |
590 | error. | |
591 | ||
169ddeb2 | 592 | * Update `step3_env.qx` to use the new `Env` type to create the |
0f4ca9d1 JM |
593 | repl_env (with a `nil` outer value) and use the `set` method to add |
594 | the numeric functions. | |
595 | ||
596 | * Modify `eval_ast` to call the `get` method on the `env` parameter. | |
597 | ||
598 | * Modify the apply section of `EVAL` to switch on the first element of | |
599 | the list: | |
600 | * symbol "def!": call the set method of the current environment | |
601 | (second parameter of `EVAL` called `env`) using the unevaluated | |
602 | first parameter (second list element) as the symbol key and the | |
603 | evaluated second parameter as the value. | |
a727d6e8 | 604 | * symbol "let\*": create a new environment using the current |
0f4ca9d1 | 605 | environment as the outer value and then use the first parameter as |
a727d6e8 MK |
606 | a list of new bindings in the "let\*" environment. Take the second |
607 | element of the binding list, call `EVAL` using the new "let\*" | |
0f4ca9d1 | 608 | environment as the evaluation environment, then call `set` on the |
a727d6e8 | 609 | "let\*" environment using the first binding list element as the key |
0f4ca9d1 JM |
610 | and the evaluated second element as the value. This is repeated |
611 | for each odd/even pair in the binding list. Note in particular, | |
612 | the bindings earlier in the list can be referred to by later | |
613 | bindings. Finally, the second parameter (third element) of the | |
a727d6e8 | 614 | original `let*` form is evaluated using the new "let\*" environment |
0f4ca9d1 JM |
615 | and the result is returned as the result of the `let*` (the new |
616 | let environment is discarded upon completion). | |
617 | * otherwise: call `eval_ast` on the list and apply the first element | |
618 | to the rest as before. | |
619 | ||
620 | `def!` and `let*` are Lisp "specials" (or "special atoms") which means | |
621 | that they are language level features and more specifically that the | |
622 | rest of the list elements (arguments) may be evaluated differently (or | |
623 | not at all) unlike the default apply case where all elements of the | |
624 | list are evaluated before the first element is invoked. Lists which | |
625 | contain a "special" as the first element are known as "special forms". | |
626 | The are special because the follow special evaluation rules. | |
627 | ||
628 | Try some simple environment tests: | |
629 | ||
630 | * `(def! a 6)` -> `6` | |
631 | * `a` -> `6` | |
632 | * `(def! b (+ a 2))` -> `8` | |
633 | * `(+ a b)` -> `14` | |
634 | * `(let* (c 2) c)` -> `2` | |
635 | ||
636 | Now go to the top level, run the step 3 tests and fix the errors. | |
637 | ``` | |
e5737b08 | 638 | make "test^quux^step3" |
0f4ca9d1 JM |
639 | ``` |
640 | ||
641 | You mal implementation is still basically just a numeric calculator | |
642 | with save/restore capability. But you have set the foundation for step | |
643 | 4 where it will begin to feel like a real programming language. | |
644 | ||
645 | ||
646 | An aside on mutation and typing: | |
647 | ||
648 | The "!" suffix on symbols is used to indicate that this symbol refers | |
649 | to a function that mutates something else. In this case, the `def!` | |
650 | symbol indicates a special form that will mutate the current | |
651 | environment. Many (maybe even most) of runtime problems that are | |
652 | encountered in software engineering are a result of mutation. By | |
653 | clearly marking code where mutation may occur, you can more easily | |
654 | track down the likely cause of runtime problems when they do occur. | |
655 | ||
656 | Another cause of runtime errors is type errors, where a value of one | |
657 | type is unexpectedly treated by the program as a different and | |
658 | incompatible type. Statically typed languages try to make the | |
659 | programmer solve all type problems before the program is allowed to | |
660 | run. Most Lisp variants tend to be dynamically typed (types of values | |
661 | are checked when they are actually used at runtime). | |
662 | ||
663 | As an aside-aside: The great debate between static and dynamic typing | |
4e3fd73b MK |
664 | can be understood by following the money. Advocates of strict static |
665 | typing use words like "correctness" and "safety" and thus get | |
0f4ca9d1 JM |
666 | government and academic funding. Advocates of dynamic typing use words |
667 | like "agile" and "time-to-market" and thus get venture capital and | |
668 | commercial funding. | |
669 | ||
670 | ||
671 | <a name="step4"></a> | |
672 | ||
673 | ### Step 4: If Fn Do | |
674 | ||
675 | ![step4_if_fn_do architecture](step4_if_fn_do.png) | |
676 | ||
677 | In step 3 you added environments and the special forms for | |
678 | manipulating environments. In this step you will add 3 new special | |
679 | forms (`if`, `fn*` and `do`) and add several more core functions to | |
680 | the default REPL environment. Our new architecture will look like | |
681 | this: | |
682 | ||
683 | The `fn*` special form is how new user-defined functions are created. | |
684 | In some Lisps, this special form is named "lambda". | |
685 | ||
686 | Compare the pseudocode for step 3 and step 4 to get a basic idea of | |
687 | the changes that will be made during this step: | |
688 | ``` | |
689 | diff -urp ../process/step3_env.txt ../process/step4_if_fn_do.txt | |
690 | ``` | |
691 | ||
692 | * Copy `step3_env.qx` to `step4_if_fn_do.qx`. | |
693 | ||
694 | * If you have not implemented reader and printer support (and data | |
695 | types) for `nil`, `true` and `false`, you will need to do so for | |
696 | this step. | |
697 | ||
698 | * Update the constructor/initializer for environments to take two new | |
699 | arguments: `binds` and `exprs`. Bind (`set`) each element (symbol) | |
700 | of the binds list to the respective element of the `exprs` list. | |
701 | ||
702 | * Add support to `printer.qx` to print functions values. A string | |
703 | literal like "#<function>" is sufficient. | |
704 | ||
1af1f7f1 | 705 | * Add the following special forms to `EVAL`: |
0f4ca9d1 | 706 | |
1af1f7f1 | 707 | * `do`: Evaluate all the elements of the list using `eval_ast` |
f558a0c8 | 708 | and return the final evaluated element. |
0f4ca9d1 JM |
709 | * `if`: Evaluate the first parameter (second element). If the result |
710 | (condition) is anything other than `nil` or `false`, then evaluate | |
1af1f7f1 | 711 | the second parameter (third element of the list) and return the |
0f4ca9d1 JM |
712 | result. Otherwise, evaluate the third parameter (fourth element) |
713 | and return the result. If condition is false and there is no third | |
714 | parameter, then just return `nil`. | |
715 | * `fn*`: Return a new function closure. The body of that closure | |
716 | does the following: | |
717 | * Create a new environment using `env` (closed over from outer | |
718 | scope) as the `outer` parameter, the first parameter (second | |
719 | list element of `ast` from the outer scope) as the `binds` | |
720 | parameter, and the parameters to the closure as the `exprs` | |
721 | parameter. | |
722 | * Call `EVAL` on the second parameter (third list element of `ast` | |
723 | from outer scope), using the new environment. Use the result as | |
724 | the return value of the closure. | |
725 | ||
726 | If your target language does not support closures, then you will need | |
727 | to implement `fn*` using some sort of structure or object that stores | |
728 | the values being closed over: the first and second elements of the | |
729 | `ast` list (function parameter list and function body) and the current | |
730 | environment `env`. In this case, your native functions will need to be | |
731 | wrapped in the same way. You will probably also need a method/function | |
732 | that invokes your function object/structure for the default case of | |
733 | the apply section of `EVAL`. | |
734 | ||
735 | Try out the basic functionality you have implemented: | |
736 | ||
737 | * `(fn* [a] a)` -> `#<function>` | |
738 | * `( (fn* [a] a) 7)` -> `7` | |
739 | * `( (fn* [a] (+ a 1)) 10)` -> `11` | |
740 | * `( (fn* [a b] (+ a b)) 2 3)` -> `5` | |
741 | ||
742 | * Add a new file `core.qx` and define an associative data structure | |
743 | `ns` (namespace) that maps symbols to functions. Move the numeric | |
744 | function definitions into this structure. | |
745 | ||
746 | * Modify `step4_if_fn_do.qx` to iterate through the `core.ns` | |
747 | structure and add (`set`) each symbol/function mapping to the | |
748 | REPL environment (`repl_env`). | |
749 | ||
750 | * Add the following functions to `core.ns`: | |
751 | * `list`: take the parameters and return them as a list. | |
752 | * `list?`: return true if the first parameter is a list, false | |
753 | otherwise. | |
754 | * `empty?`: treat the first parameter as a list and return true if | |
755 | the list is empty and false if it contains any elements. | |
756 | * `count`: treat the first parameter as a list and return the number | |
757 | of elements that it contains. | |
758 | * `=`: compare the first two parameters and return true if they are | |
759 | the same type and contain the same value. In the case of equal | |
760 | length lists, each element of the list should be compared for | |
761 | equality and if they are the same return true, otherwise false. | |
762 | * `<`, `<=`, `>`, and `>=`: treat the first two parameters as | |
763 | numbers and do the corresponding numeric comparison, returning | |
764 | either true or false. | |
765 | ||
766 | Now go to the top level, run the step 4 tests. There are a lot of | |
767 | tests in step 4 but all of the non-optional tests that do not involve | |
768 | strings should be able to pass now. | |
769 | ||
770 | ``` | |
e5737b08 | 771 | make "test^quux^step4" |
0f4ca9d1 JM |
772 | ``` |
773 | ||
774 | Your mal implementation is already beginning to look like a real | |
775 | language. You have flow control, conditionals, user-defined functions | |
776 | with lexical scope, side-effects (if you implement the string | |
1380d8c1 JM |
777 | functions), etc. However, our little interpreter has not quite reached |
778 | Lisp-ness yet. The next several steps will take your implementation | |
779 | from a neat toy to a full featured language. | |
0f4ca9d1 | 780 | |
45a8b3ca | 781 | #### Deferrable: |
0f4ca9d1 JM |
782 | |
783 | * Implement Clojure-style variadic function parameters. Modify the | |
784 | constructor/initializer for environments, so that if a "&" symbol is | |
785 | encountered in the `binds` list, the next symbol in the `binds` list | |
786 | after the "&" is bound to the rest of the `exprs` list that has not | |
787 | been bound yet. | |
788 | ||
789 | * Defines a `not` function using mal itself. In `step4_if_fn_do.qx` | |
790 | call the `rep` function with this string: | |
791 | "(def! not (fn* (a) (if a false true)))". | |
792 | ||
793 | * Implement the strings functions in `core.qx`. To implement these | |
794 | functions, you will need to implement the string support in the | |
45a8b3ca | 795 | reader and printer (deferrable section of step 1). Each of the string |
0f4ca9d1 JM |
796 | functions takes multiple mal values, prints them (`pr_str`) and |
797 | joins them together into a new string. | |
798 | * `pr-str`: calls `pr_str` on each argument with `print_readably` | |
799 | set to true, joins the results with " " and returns the new | |
800 | string. | |
801 | * `str`: calls `pr_str` on each argument with `print_readably` set | |
802 | to false, concatenates the results together ("" separator), and | |
803 | returns the new string. | |
804 | * `prn`: calls `pr_str` on each argument with `print_readably` set | |
805 | to true, joins the results with " ", prints the string to the | |
806 | screen and then returns `nil`. | |
807 | * `println`: calls `pr_str` on each argument with `print_readably` set | |
808 | to false, joins the results with " ", prints the string to the | |
809 | screen and then returns `nil`. | |
810 | ||
811 | ||
812 | <a name="step5"></a> | |
813 | ||
814 | ### Step 5: Tail call optimization | |
815 | ||
816 | ![step5_tco architecture](step5_tco.png) | |
817 | ||
818 | In step 4 you added special forms `do`, `if` and `fn*` and you defined | |
819 | some core functions. In this step you will add a Lisp feature called | |
820 | tail call optimization (TCO). Also called "tail recursion" or | |
821 | sometimes just "tail calls". | |
822 | ||
823 | Several of the special forms that you have defined in `EVAL` end up | |
824 | calling back into `EVAL`. For those forms that call `EVAL` as the last | |
825 | thing that they do before returning (tail call) you will just loop back | |
826 | to the beginning of eval rather than calling it again. The advantage | |
827 | of this approach is that it avoids adding more frames to the call | |
828 | stack. This is especially important in Lisp languages because they do | |
829 | not tend to have iteration control structures preferring recursion | |
830 | instead. However, with tail call optimization, recursion can be made | |
831 | as stack efficient as iteration. | |
832 | ||
833 | Compare the pseudocode for step 4 and step 5 to get a basic idea of | |
834 | the changes that will be made during this step: | |
835 | ``` | |
836 | diff -urp ../process/step4_if_fn_do.txt ../process/step5_tco.txt | |
837 | ``` | |
838 | ||
0303d604 | 839 | * Copy `step4_if_fn_do.qx` to `step5_tco.qx`. |
0f4ca9d1 JM |
840 | |
841 | * Add a loop (e.g. while true) around all code in `EVAL`. | |
842 | ||
843 | * Modify each of the following form cases to add tail call recursion | |
844 | support: | |
845 | * `let*`: remove the final `EVAL` call on the second `ast` argument | |
846 | (third list element). Set `env` (i.e. the local variable passed in | |
847 | as second parameter of `EVAL`) to the new let environment. Set | |
848 | `ast` (i.e. the local variable passed in as first parameter of | |
849 | `EVAL`) to be the second `ast` argument. Continue at the beginning | |
850 | of the loop (no return). | |
851 | * `do`: change the `eval_ast` call to evaluate all the parameters | |
4e7296f9 JM |
852 | except for the last (2nd list element up to but not including |
853 | last). Set `ast` to the last element of `ast`. Continue | |
0f4ca9d1 JM |
854 | at the beginning of the loop (`env` stays unchanged). |
855 | * `if`: the condition continues to be evaluated, however, rather | |
856 | than evaluating the true or false branch, `ast` is set to the | |
857 | unevaluated value of the chosen branch. Continue at the beginning | |
858 | of the loop (`env` is unchanged). | |
859 | ||
860 | * The return value from the `fn*` special form will now become an | |
861 | object/structure with attributes that allow the default invoke case | |
862 | of `EVAL` to do TCO on mal functions. Those attributes are: | |
0f4ca9d1 JM |
863 | * `ast`: the second `ast` argument (third list element) representing |
864 | the body of the function. | |
865 | * `params`: the first `ast` argument (second list element) | |
866 | representing the parameter names of the function. | |
867 | * `env`: the current value of the `env` parameter of `EVAL`. | |
4e7296f9 JM |
868 | * `fn`: the original function value (i.e. what was return by `fn*` |
869 | in step 4). Note that this is deferrable until step 9 when it is | |
870 | needed for the `map` and `apply` core functions). | |
0f4ca9d1 JM |
871 | |
872 | * The default "apply"/invoke case of `EVAL` must now be changed to | |
873 | account for the new object/structure returned by the `fn*` form. | |
874 | Continue to call `eval_ast` on `ast`. The first element is `f`. | |
875 | Switch on the type of `f`: | |
876 | * regular function (not one defined by `fn*`): apply/invoke it as | |
4e7296f9 | 877 | before (in step 4). |
0f4ca9d1 JM |
878 | * a `fn*` value: set `ast` to the `ast` attribute of `f`. Generate |
879 | a new environment using the `env` and `params` attributes of `f` | |
880 | as the `outer` and `binds` arguments and rest `ast` arguments | |
881 | (list elements 2 through the end) as the `exprs` argument. Set | |
882 | `env` to the new environment. Continue at the beginning of the loop. | |
883 | ||
884 | Run some manual tests from previous steps to make sure you have not | |
885 | broken anything by adding TCO. | |
886 | ||
887 | Now go to the top level, run the step 5 tests. | |
888 | ||
889 | ``` | |
e5737b08 | 890 | make "test^quux^step5" |
0f4ca9d1 JM |
891 | ``` |
892 | ||
893 | Look at the step 5 test file `tests/step5_tco.mal`. The `sum-to` | |
894 | function cannot be tail call optimized because it does something after | |
895 | the recursive call (`sum-to` calls itself and then does the addition). | |
896 | Lispers say that the `sum-to` is not in tail position. The `sum2` | |
897 | function however, calls itself from tail position. In other words, the | |
898 | recursive call to `sum2` is the last action that `sum2` does. Calling | |
899 | `sum-to` with a large value will cause a stack overflow exception in | |
900 | most target languages (some have super-special tricks they use to | |
901 | avoid stack overflows). | |
902 | ||
903 | Congratulations, your mal implementation already has a feature (TCO) | |
904 | that most mainstream languages lack. | |
905 | ||
906 | ||
907 | <a name="step6"></a> | |
908 | ||
396d869e | 909 | ### Step 6: Files, Mutation, and Evil |
0f4ca9d1 JM |
910 | |
911 | ![step6_file architecture](step6_file.png) | |
912 | ||
913 | In step 5 you added tail call optimization. In this step you will add | |
914 | some string and file operations and give your implementation a touch | |
915 | of evil ... er, eval. And as long as your language supports function | |
916 | closures, this step will be quite simple. However, to complete this | |
917 | step, you must implement string type support, so if you have been | |
918 | holding off on that you will need to go back and do so. | |
919 | ||
920 | Compare the pseudocode for step 5 and step 6 to get a basic idea of | |
921 | the changes that will be made during this step: | |
922 | ``` | |
923 | diff -urp ../process/step5_tco.txt ../process/step6_file.txt | |
924 | ``` | |
925 | ||
ffd31966 JM |
926 | * Copy `step5_tco.qx` to `step6_file.qx`. |
927 | ||
0f4ca9d1 JM |
928 | * Add two new string functions to the core namespaces: |
929 | * `read-string`: this function just exposes the `read_str` function | |
930 | from the reader. If your mal string type is not the same as your | |
931 | target language (e.g. statically typed language) then your | |
932 | `read-string` function will need to unbox (extract) the raw string | |
933 | from the mal string type in order to call `read_str`. | |
934 | * `slurp`: this function takes a file name (string) and returns the | |
935 | contents of the file as a string. Once again, if your mal string | |
936 | type wraps a raw target language string, then you will need to | |
937 | unmarshall (extract) the string parameter to get the raw file name | |
938 | string and marshall (wrap) the result back to a mal string type. | |
939 | ||
6fef8e58 JM |
940 | * In your main program, add a new symbol "eval" to your REPL |
941 | environment. The value of this new entry is a function that takes | |
942 | a single argument `ast`. The closure calls the your `EVAL` function | |
943 | using the `ast` as the first argument and the REPL environment | |
944 | (closed over from outside) as the second argument. The result of | |
945 | the `EVAL` call is returned. This simple but powerful addition | |
946 | allows your program to treat mal data as a mal program. For example, | |
cfdf00cc | 947 | you can now to this: |
6fef8e58 JM |
948 | ``` |
949 | (def! mal-prog (list + 1 2)) | |
950 | (eval mal-prog) | |
951 | ``` | |
0f4ca9d1 JM |
952 | |
953 | * Define a `load-file` function using mal itself. In your main | |
954 | program call the `rep` function with this string: | |
955 | "(def! load-file (fn* (f) (eval (read-string (str \"(do \" (slurp f) \")\")))))". | |
956 | ||
957 | Try out `load-file`: | |
958 | * `(load-file "../tests/incA.mal")` -> `9` | |
959 | * `(inc4 3)` -> `7` | |
960 | ||
961 | The `load-file` function does the following: | |
962 | * Call `slurp` to read in a file by name. Surround the contents with | |
963 | "(do ...)" so that the whole file will be treated as a single | |
964 | program AST (abstract syntax tree). | |
965 | * Call `read-string` on the string returned from `slurp`. This uses | |
966 | the reader to read/convert the file contents into mal data/AST. | |
967 | * Call `eval` (the one in the REPL environment) on the AST returned | |
968 | from `read-string` to "run" it. | |
969 | ||
627bd6f7 DM |
970 | Besides adding file and eval support, we'll add support for the atom data type |
971 | in this step. An atom is the Mal way to represent *state*; it is | |
972 | heavily inspired by [Clojure's atoms](http://clojure.org/state). An atom holds | |
973 | a reference to a single Mal value of any type; it supports reading that Mal value | |
974 | and *modifying* the reference to point to another Mal value. Note that this is | |
975 | the only Mal data type that is mutable (but the Mal values it refers to are | |
976 | still immutable; immutability is explained in greater detail in step 7). | |
a85b8454 | 977 | You'll need to add 5 functions to the core namespace to support atoms: |
627bd6f7 DM |
978 | |
979 | * `atom`: Takes a Mal value and returns a new atom which points to that Mal value. | |
980 | * `atom?`: Takes an argument and returns `true` if the argument is an atom. | |
981 | * `deref`: Takes an atom argument and returns the Mal value referenced by this atom. | |
982 | * `reset!`: Takes an atom and a Mal value; the atom is modified to refer to | |
983 | the given Mal value. The Mal value is returned. | |
984 | * `swap!`: Takes an atom, a function, and zero or more function arguments. The | |
985 | atom's value is modified to result of applying the function with the atom's | |
986 | value as the first argument and the optionally given function arguments as | |
987 | the rest of the arguments. The new atom's value is returned. (Side note: Mal is | |
988 | single-threaded, but in concurrent languages like Clojure, `swap!` promises | |
989 | atomic update: `(swap! myatom (fn* [x] (+ 1 x)))` will always increase the | |
990 | `myatom` counter by one and will not suffer from missing updates when the | |
991 | atom is updated from multiple threads.) | |
992 | ||
993 | Optionally, you can add a reader macro `@` which will serve as a short form for | |
994 | `deref`, so that `@a` is equivalent to `(deref a)`. In order to do that, modify | |
995 | the conditional in reader `read_form` function and add a case which deals with | |
996 | the `@` token: if the token is `@` (at sign) then return a new list that | |
997 | contains the symbol `deref` and the result of reading the next form | |
998 | (`read_form`). | |
999 | ||
0f4ca9d1 | 1000 | Now go to the top level, run the step 6 tests. The optional tests will |
627bd6f7 DM |
1001 | need support from the reader for comments, vectors, hash-maps and the `@` |
1002 | reader macro: | |
0f4ca9d1 | 1003 | ``` |
e5737b08 | 1004 | make "test^quux^step6" |
0f4ca9d1 JM |
1005 | ``` |
1006 | ||
1007 | Congratulations, you now have a full-fledged scripting language that | |
6fef8e58 JM |
1008 | can run other mal programs. The `slurp` function loads a file as |
1009 | a string, the `read-string` function calls the mal reader to turn that | |
10a76646 | 1010 | string into data, and the `eval` function takes data and evaluates it |
6fef8e58 JM |
1011 | as a normal mal program. However, it is important to note that the |
1012 | `eval` function is not just for running external programs. Because mal | |
1013 | programs are regular mal data structures, you can dynamically generate | |
1014 | or manipulate those data structures before calling `eval` on them. | |
a85b8454 | 1015 | This isomorphism (same shape) between data and programs is known as |
6fef8e58 JM |
1016 | "homoiconicity". Lisp languages are homoiconic and this property |
1017 | distinguishes them from most other programming languages. | |
1018 | ||
1019 | You mal implementation is quite powerful already but the set of | |
1020 | functions that are available (from `core.qx`) is fairly limited. The | |
1021 | bulk of the functions you will add are described in step 9 and step A, | |
1022 | but you will begin to flesh them out over the next few steps to | |
1023 | support quoting (step 7) and macros (step 8). | |
0f4ca9d1 JM |
1024 | |
1025 | ||
45a8b3ca | 1026 | #### Deferrable: |
0f4ca9d1 JM |
1027 | |
1028 | * Add the ability to run another mal program from the command line. | |
1029 | Prior to the REPL loop, check if your mal implementation is called | |
1030 | with command line arguments. If so, treat the first argument as | |
1031 | a filename and use `rep` to call `load-file` on that filename, and | |
1032 | finally exit/terminate execution. | |
1033 | ||
1034 | * Add the rest of the command line arguments to your REPL environment | |
1035 | so that programs that are run with `load-file` have access to their | |
a85b8454 | 1036 | calling environment. Add a new "\*ARGV\*" (symbol) entry to your REPL |
0f4ca9d1 JM |
1037 | environment. The value of this entry should be the rest of the |
1038 | command line arguments as a mal list value. | |
1039 | ||
1040 | ||
1041 | <a name="step7"></a> | |
1042 | ||
1043 | ### Step 7: Quoting | |
1044 | ||
1045 | ![step7_quote architecture](step7_quote.png) | |
1046 | ||
1047 | In step 7 you will add the special forms `quote` and `quasiquote` and | |
1048 | add supporting core functions `cons` and `concat`. The two quote forms | |
1049 | add a powerful abstraction for manipulating mal code itself | |
1050 | (meta-programming). | |
1051 | ||
0f4ca9d1 JM |
1052 | The `quote` special form indicates to the evaluator (`EVAL`) that the |
1053 | parameter should not be evaluated (yet). At first glance, this might | |
10a76646 | 1054 | not seem particularly useful but an example of what this enables is the |
0f4ca9d1 JM |
1055 | ability for a mal program to refer to a symbol itself rather than the |
1056 | value that it evaluates to. Likewise with lists. For example, consider | |
1057 | the following: | |
1058 | ||
1059 | * `(prn abc)`: this will lookup the symbol `abc` in the current | |
1060 | evaluation environment and print it. This will result in error if | |
1061 | `abc` is not defined. | |
1062 | * `(prn (quote abc))`: this will print "abc" (prints the symbol | |
1063 | itself). This will work regardless of whether `abc` is defined in | |
1064 | the current environment. | |
1065 | * `(prn (1 2 3))`: this will result in an error because `1` is not | |
1066 | a function and cannot be applied to the arguments `(2 3)`. | |
1067 | * `(prn (quote (1 2 3)))`: this will print "(1 2 3)". | |
1068 | * `(def! l (quote (1 2 3)))`: list quoting allows us to define lists | |
1069 | directly in the code (list literal). Another way of doing this is | |
1070 | with the list function: `(def! l (list 1 2 3))`. | |
1071 | ||
1072 | The second special quoting form is `quasiquote`. This allows a quoted | |
1073 | list to have internal elements of the list that are temporarily | |
1074 | unquoted (normal evaluation). There are two special forms that only | |
1075 | mean something within a quasiquoted list: `unquote` and | |
1076 | `splice-unquote`. These are perhaps best explained with some examples: | |
1077 | ||
1078 | * `(def! lst (quote (2 3)))` -> `(2 3)` | |
1079 | * `(quasiquote (1 (unquote lst)))` -> `(1 (2 3))` | |
1080 | * `(quasiquote (1 (splice-unquote lst)))` -> `(1 2 3)` | |
1081 | ||
1082 | The `unquote` form turns evaluation back on for its argument and the | |
1083 | result of evaluation is put in place into the quasiquoted list. The | |
1084 | `splice-unquote` also turns evaluation back on for its argument, but | |
1085 | the evaluated value must be a list which is then "spliced" into the | |
1086 | quasiquoted list. The true power of the quasiquote form will be | |
1087 | manifest when it used together with macros (in the next step). | |
1088 | ||
ffd31966 JM |
1089 | Compare the pseudocode for step 6 and step 7 to get a basic idea of |
1090 | the changes that will be made during this step: | |
1091 | ``` | |
1092 | diff -urp ../process/step6_file.txt ../process/step7_quote.txt | |
1093 | ``` | |
1094 | ||
1095 | * Copy `step6_file.qx` to `step7_quote.qx`. | |
1096 | ||
0f4ca9d1 JM |
1097 | * Before implementing the quoting forms, you will need to implement |
1098 | * some supporting functions in the core namespace: | |
1099 | * `cons`: this function takes a list as its second | |
1100 | parameter and returns a new list that has the first argument | |
1101 | prepended to it. | |
1102 | * `concat`: this functions takes 0 or more lists as | |
1103 | parameters and returns a new list that is a concatenation of all | |
1104 | the list parameters. | |
1105 | ||
1106 | An aside on immutability: note that neither cons or concat mutate | |
1107 | their original list arguments. Any references to them (i.e. other | |
1108 | lists that they may be "contained" in) will still refer to the | |
1109 | original unchanged value. Mal, like Clojure, is a language which uses | |
1110 | immutable data structures. I encourage you to read about the power and | |
1111 | importance of immutability as implemented in Clojure (from which | |
1112 | Mal borrows most of its syntax and feature-set). | |
1113 | ||
1114 | * Add the `quote` special form. This form just returns its argument | |
1115 | (the second list element of `ast`). | |
1116 | ||
1117 | * Add the `quasiquote` special form. First implement a helper function | |
1118 | `is_pair` that returns true if the parameter is a non-empty list. | |
1119 | Then define a `quasiquote` function. This is called from `EVAL` with | |
1120 | the first `ast` argument (second list element) and then `ast` is set | |
1121 | to the result and execution continues at the top of the loop (TCO). | |
1122 | The `quasiquote` function takes a parameter `ast` and has the | |
1123 | following conditional: | |
1124 | 1. if `is_pair` of `ast` is false: return a new list containing: | |
1125 | a symbol named "quote" and `ast`. | |
1126 | 2. else if the first element of `ast` is a symbol named "unquote": | |
1127 | return the second element of `ast`. | |
1128 | 3. if `is_pair` of first element of `ast` is true and the first | |
1129 | element of first element of `ast` (`ast[0][0]`) is a symbol named | |
1130 | "splice-unquote": return a new list containing: a symbol named | |
1131 | "concat", the second element of first element of `ast` | |
1132 | (`ast[0][1]`), and the result of calling `quasiquote` with the | |
1133 | second through last element of `ast`. | |
1134 | 4. otherwise: return a new list containing: a symbol named "cons", the | |
1135 | result of calling `quasiquote` on first element of `ast` | |
1136 | (`ast[0]`), and result of calling `quasiquote` with the second | |
1137 | through last element of `ast`. | |
1138 | ||
1139 | ||
1140 | Now go to the top level, run the step 7 tests: | |
1141 | ``` | |
e5737b08 | 1142 | make "test^quux^step7" |
0f4ca9d1 JM |
1143 | ``` |
1144 | ||
1145 | Quoting is one of the more mundane functions available in mal, but do | |
1146 | not let that discourage you. Your mal implementation is almost | |
1147 | complete, and quoting sets the stage for the next very exiting step: | |
1148 | macros. | |
1149 | ||
1150 | ||
45a8b3ca | 1151 | #### Deferrable |
0f4ca9d1 JM |
1152 | |
1153 | * The full names for the quoting forms are fairly verbose. Most Lisp | |
1154 | languages have a short-hand syntax and Mal is no exception. These | |
1155 | short-hand syntaxes are known as reader macros because they allow us | |
1156 | to manipulate mal code during the reader phase. Macros that run | |
1157 | during the eval phase are just called "macros" and are described in | |
1158 | the next section. Expand the conditional with reader `read_form` | |
1159 | function to add the following four cases: | |
1160 | * token is "'" (single quote): return a new list that contains the | |
1161 | symbol "quote" and the result of reading the next form | |
1162 | (`read_form`). | |
8f41f75a | 1163 | * token is "\`" (back-tick): return a new list that contains the |
0f4ca9d1 JM |
1164 | symbol "quasiquote" and the result of reading the next form |
1165 | (`read_form`). | |
1166 | * token is "~" (tilde): return a new list that contains the | |
1167 | symbol "unquote" and the result of reading the next form | |
1168 | (`read_form`). | |
1169 | * token is "~@" (tilde + at sign): return a new list that contains | |
1170 | the symbol "splice-unquote" and the result of reading the next | |
1171 | form (`read_form`). | |
1172 | ||
1173 | * Add support for quoting of vectors. The `is_pair` function should | |
1174 | return true if the argument is a non-empty list or vector. `cons` | |
1175 | should also accept a vector as the second argument. The return value | |
1176 | is a list regardless. `concat` should support concatenation of | |
1177 | lists, vectors, or a mix or both. The result is always a list. | |
1178 | ||
1179 | ||
1180 | <a name="step8"></a> | |
1181 | ||
1182 | ### Step 8: Macros | |
1183 | ||
1184 | ![step8_macros architecture](step8_macros.png) | |
1185 | ||
a85b8454 | 1186 | Your mal implementation is now ready for one of the most lispy and |
0f4ca9d1 JM |
1187 | exciting of all programming concepts: macros. In the previous step, |
1188 | quoting enabled some simple manipulation data structures and therefore | |
1189 | manipulation of mal code (because the `eval` function from step | |
1190 | 6 turns mal data into code). In this step you will be able to mark mal | |
1191 | functions as macros which can manipulate mal code before it is | |
1192 | evaluated. In other words, macros are user-defined special forms. Or | |
1193 | to look at it another way, macros allow mal programs to redefine | |
1194 | the mal language itself. | |
1195 | ||
1196 | Compare the pseudocode for step 7 and step 8 to get a basic idea of | |
1197 | the changes that will be made during this step: | |
1198 | ``` | |
1199 | diff -urp ../process/step7_quote.txt ../process/step8_macros.txt | |
1200 | ``` | |
1201 | ||
ffd31966 JM |
1202 | * Copy `step7_quote.qx` to `step8_macros.qx`. |
1203 | ||
1204 | ||
0f4ca9d1 JM |
1205 | You might think that the infinite power of macros would require some |
1206 | sort of complex mechanism, but the implementation is actually fairly | |
1207 | simple. | |
1208 | ||
1209 | * Add a new attribute `is_macro` to mal function types. This should | |
1210 | default to false. | |
1211 | ||
1212 | * Add a new special form `defmacro!`. This is very similar to the | |
1213 | `def!` form, but before the evaluated value (mal function) is set in | |
1214 | the environment, the `is_macro` attribute should be set to true. | |
1215 | ||
1216 | * Add a `is_macro_call` function: This function takes arguments `ast` | |
1217 | and `env`. It returns true if `ast` is a list that contains a symbol | |
1218 | as the first element and that symbol refers to a function in the | |
1219 | `env` environment and that function has the `is_macro` attribute set | |
1220 | to true. Otherwise, it returns false. | |
1221 | ||
1222 | * Add a `macroexpand` function: This function takes arguments `ast` | |
1223 | and `env`. It calls `is_macro_call` with `ast` and `env` and loops | |
1224 | while that condition is true. Inside the loop, the first element of | |
1225 | the `ast` list (a symbol), is looked up in the environment to get | |
1226 | the macro function. This macro function is then called/applied with | |
1227 | the rest of the `ast` elements (2nd through the last) as arguments. | |
1228 | The return value of the macro call becomes the new value of `ast`. | |
1229 | When the loop completes because `ast` no longer represents a macro | |
1230 | call, the current value of `ast` is returned. | |
1231 | ||
1232 | * In the evaluator (`EVAL`) before the special forms switch (apply | |
1233 | section), perform macro expansion by calling the `macroexpand` | |
1234 | function with the current value of `ast` and `env`. Set `ast` to the | |
1235 | result of that call. If the new value of `ast` is no longer a list | |
9b4cfe03 JM |
1236 | after macro expansion, then return the result of calling `eval_ast` |
1237 | on it, otherwise continue with the rest of the apply section | |
1238 | (special forms switch). | |
0f4ca9d1 JM |
1239 | |
1240 | * Add a new special form condition for `macroexpand`. Call the | |
1241 | `macroexpand` function using the first `ast` argument (second list | |
1242 | element) and `env`. Return the result. This special form allows | |
1243 | a mal program to do explicit macro expansion without applying the | |
1244 | result (which can be useful for debugging macro expansion). | |
1245 | ||
1246 | Now go to the top level, run the step 8 tests: | |
1247 | ``` | |
e5737b08 | 1248 | make "test^quux^step8" |
0f4ca9d1 JM |
1249 | ``` |
1250 | ||
8a98ef9a JM |
1251 | There is a reasonably good chance that the macro tests will not pass |
1252 | the first time. Although the implementation of macros is fairly | |
1253 | simple, debugging runtime bugs with macros can be fairly tricky. If | |
1254 | you do run into subtle problems that are difficult to solve, let me | |
1255 | recommend a couple of approaches: | |
1256 | ||
1257 | * Use the macroexpand special form to eliminate one of the layers of | |
1258 | indirection (to expand but skip evaluate). This will often reveal | |
1259 | the source of the issue. | |
1260 | * Add a debug print statement to the top of your main `eval` function | |
1261 | (inside the TCO loop) to print the current value of `ast` (hint use | |
1262 | `pr_str` to get easier to debug output). Pull up the step8 | |
1263 | implementation from another language and uncomment its `eval` | |
1264 | function (yes, I give you permission to violate the rule this once). | |
1265 | Run the two side-by-side. The first difference is likely to point to | |
1266 | the bug. | |
1267 | ||
1268 | Congratulations! You now have a Lisp interpreter with a super power | |
1269 | that most non-Lisp languages can only dream of (I have it on good | |
1270 | authority that languages dream when you are not using them). If you | |
1271 | are not already familiar with Lisp macros, I suggest the following | |
a85b8454 | 1272 | exercise: write a recursive macro that handles postfixed mal code |
8a98ef9a JM |
1273 | (with the function as the last parameter instead of the first). Or |
1274 | not. I have not actually done so myself, but I have heard it is an | |
a85b8454 | 1275 | interesting exercise. |
8a98ef9a JM |
1276 | |
1277 | In the next step you will add try/catch style exception handling to | |
1278 | your implementation in addition to some new core functions. After | |
1279 | step9 you will be very close to having a fully self-hosting mal | |
1280 | implementation. Let us continue! | |
1281 | ||
0f4ca9d1 | 1282 | |
dc791440 | 1283 | #### Deferrable |
0f4ca9d1 JM |
1284 | |
1285 | * Add the following new core functions which are frequently used in | |
1286 | macro functions: | |
1287 | * `nth`: this function takes a list (or vector) and a number (index) | |
1288 | as arguments, returns the element of the list at the given index. | |
1289 | If the index is out of range, this function raises an exception. | |
1290 | * `first`: this function takes a list (or vector) as its argument | |
1291 | and return the first element. If the list (or vector) is empty or | |
1292 | is `nil` then `nil` is returned. | |
1293 | * `rest`: this function takes a list (or vector) as its argument and | |
1294 | returns a new list containing all the elements except the first. | |
1295 | ||
1296 | * In the main program, use the `rep` function to define two new | |
1297 | control structures macros. Here are the string arguments for `rep` | |
1298 | to define these macros: | |
1299 | * `cond`: "(defmacro! cond (fn* (& xs) (if (> (count xs) 0) (list 'if (first xs) (if (> (count xs) 1) (nth xs 1) (throw \"odd number of forms to cond\")) (cons 'cond (rest (rest xs)))))))" | |
1300 | * `or`: "(defmacro! or (fn* (& xs) (if (empty? xs) nil (if (= 1 (count xs)) (first xs) `(let* (or_FIXME ~(first xs)) (if or_FIXME or_FIXME (or ~@(rest xs))))))))" | |
1301 | ||
1302 | ||
ffd31966 JM |
1303 | <a name="step9"></a> |
1304 | ||
1305 | ### Step 9: Try | |
1306 | ||
1307 | ![step9_try architecture](step9_try.png) | |
1308 | ||
2345a3da JM |
1309 | In this step you will implement the final mal special form for |
1310 | error/exception handling: `try*/catch*`. You will also add several core | |
10a76646 AS |
1311 | functions to your implementation. In particular, you will enhance the |
1312 | functional programming pedigree of your implementation by adding the | |
2345a3da JM |
1313 | `apply` and `map` core functions. |
1314 | ||
ffd31966 | 1315 | Compare the pseudocode for step 8 and step 9 to get a basic idea of |
dbac60df | 1316 | the changes that will be made during this step: |
ffd31966 JM |
1317 | ``` |
1318 | diff -urp ../process/step8_macros.txt ../process/step9_try.txt | |
1319 | ``` | |
1320 | ||
1321 | * Copy `step8_macros.qx` to `step9_try.qx`. | |
1322 | ||
2345a3da JM |
1323 | * Add the `try*/catch*` special form to the EVAL function. The |
1324 | try catch form looks like this: `(try* A (catch* B C))`. The form | |
1325 | `A` is evaluated, if it throws an exception, then form `C` is | |
1326 | evaluated with a new environment that binds the symbol B to the | |
1327 | value of the exception that was thrown. | |
1328 | * If your target language has built-in try/catch style exception | |
1329 | handling then you are already 90% of the way done. Add a | |
1330 | (native language) try/catch block that calls evaluates `A` within | |
1331 | the try block and catches all exceptions. If an exception is | |
1332 | caught, then translate it to a mal type/value. For native | |
1333 | exceptions this is either the message string or a mal hash-map | |
1334 | that contains the message string and other attributes of the | |
1335 | exception. When a regular mal types/values is used as an | |
1336 | exception, you will probably need to store it within a native | |
1337 | exception type in order to be able to convey/transport it using | |
1338 | the native try/catch mechanism. Then you will extract the mal | |
1339 | type/value from the native exception. Create a new mal environment | |
1340 | that binds B to the value of the exception. Finally, evaluate `C` | |
1341 | using that new environment. | |
1342 | * If your target language does not have built-in try/catch style | |
1343 | exception handling then you have some extra work to do. One of the | |
1344 | most straightforward approaches is to create a a global error | |
1345 | variable that stores the thrown mal type/value. The complication | |
1346 | is that there are a bunch of places where you must check to see if | |
1347 | the global error state is set and return without proceeding. The | |
1348 | rule of thumb is that this check should happen at the top of your | |
1349 | EVAL function and also right after any call to EVAL (and after any | |
1350 | function call that might happen to call EVAL further down the | |
1351 | chain). Yes, it is ugly, but you were warned in the section on | |
1352 | picking a language. | |
1353 | ||
cfdf00cc | 1354 | * Add the `throw` core function. |
2345a3da JM |
1355 | * If your language supports try/catch style exception handling, then |
1356 | this function takes a mal type/value and throws/raises it as an | |
1357 | exception. In order to do this, you may need to create a custom | |
1358 | exception object that wraps a mal value/type. | |
1359 | * If your language does not support try/catch style exception | |
1360 | handling, then set the global error state to the mal type/value. | |
1361 | ||
1362 | * Add the `apply` and `map` core functions. In step 5, if you did not | |
1363 | add the original function (`fn`) to the structure returned from | |
bd62ff74 JM |
1364 | `fn*`, the you will need to do so now. |
1365 | * `apply`: takes at least two arguments. The first argument is | |
1366 | a function and the last argument is list (or vector). The | |
a85b8454 | 1367 | arguments between the function and the last argument (if there are |
bd62ff74 JM |
1368 | any) are concatenated with the final argument to create the |
1369 | arguments that are used to call the function. The apply | |
1370 | function allows a function to be called with arguments that are | |
1371 | contained in a list (or vector). In other words, `(apply F A B [C | |
1372 | D])` is equivalent to `(F A B C D)`. | |
1373 | * `map`: takes a function and a list (or vector) and evaluates the | |
1374 | function against every element of the list (or vector) one at | |
1375 | a time and returns the results as a list. | |
2345a3da JM |
1376 | |
1377 | * Add some type predicates core functions. In Lisp, predicates are | |
1378 | functions that return true/false (or true value/nil) and typically | |
bd62ff74 JM |
1379 | end in "?" or "p". |
1380 | * `nil?`: takes a single argument and returns true (mal true value) | |
1381 | if the argument is nil (mal nil value). | |
1382 | * `true?`: takes a single argument and returns true (mal true value) | |
1383 | if the argument is a true value (mal true value). | |
1384 | * `false?`: takes a single argument and returns true (mal true | |
1385 | value) if the argument is a false value (mal false value). | |
1386 | * `symbol?`: takes a single argument and returns true (mal true | |
1387 | value) if the argument is a symbol (mal symbol value). | |
1388 | ||
1389 | Now go to the top level, run the step 9 tests: | |
1390 | ``` | |
e5737b08 | 1391 | make "test^quux^step9" |
bd62ff74 JM |
1392 | ``` |
1393 | ||
1394 | Your mal implementation is now essentially a fully featured Lisp | |
1395 | interpreter. But if you stop now you will miss one of the most | |
1396 | satisfying and enlightening aspects of creating a mal implementation: | |
1397 | self-hosting. | |
2345a3da | 1398 | |
dc791440 | 1399 | #### Deferrable |
2345a3da | 1400 | |
e37d9b49 JM |
1401 | * Add the following new core functions: |
1402 | * `symbol`: takes a string and returns a new symbol with the string | |
1403 | as its name. | |
1404 | * `keyword`: takes a string and returns a keyword with the same name | |
1405 | (usually just be prepending the special keyword | |
1406 | unicode symbol). This function should also detect if the argument | |
1407 | is already a keyword and just return it. | |
1408 | * `keyword?`: takes a single argument and returns true (mal true | |
1409 | value) if the argument is a keyword, otherwise returns false (mal | |
1410 | false value). | |
1411 | * `vector`: takes a variable number of arguments and returns | |
1412 | a vector containing those arguments. | |
1413 | * `vector?`: takes a single argument and returns true (mal true | |
1414 | value) if the argument is a vector, otherwise returns false (mal | |
1415 | false value). | |
1416 | * `hash-map`: takes a variable but even number of arguments and | |
1417 | returns a new mal hash-map value with keys from the odd arguments | |
1418 | and values from the even arguments respectively. This is basically | |
1419 | the functional form of the `{}` reader literal syntax. | |
1420 | * `map?`: takes a single argument and returns true (mal true | |
1421 | value) if the argument is a hash-map, otherwise returns false (mal | |
1422 | false value). | |
1423 | * `assoc`: takes a hash-map as the first argument and the remaining | |
1424 | arguments are odd/even key/value pairs to "associate" (merge) into | |
1425 | the hash-map. Note that the original hash-map is unchanged | |
1426 | (remember, mal values are immutable), and a new hash-map | |
1427 | containing the old hash-maps key/values plus the merged key/value | |
1428 | arguments is returned. | |
1429 | * `dissoc`: takes a hash-map and a list of keys to remove from the | |
1430 | hash-map. Again, note that the original hash-map is unchanged and | |
1431 | a new hash-map with the keys removed is returned. Key arguments | |
1432 | that do not exist in the hash-map are ignored. | |
1433 | * `get`: takes a hash-map and a key and returns the value of looking | |
1434 | up that key in the hash-map. If the key is not found in the | |
1435 | hash-map then nil is returned. | |
1436 | * `contains?`: takes a hash-map and a key and returns true (mal true | |
1437 | value) if the key exists in the hash-map and false (mal false | |
1438 | value) otherwise. | |
1439 | * `keys`: takes a hash-map and returns a list (mal list value) of | |
1440 | all the keys in the hash-map. | |
1441 | * `vals`: takes a hash-map and returns a list (mal list value) of | |
1442 | all the values in the hash-map. | |
1443 | * `sequential?`: takes a single arguments and returns true (mal true | |
1444 | value) if it is a list or a vector, otherwise returns false (mal | |
1445 | false value). | |
ffd31966 JM |
1446 | |
1447 | ||
8569b2af | 1448 | <a name="stepA"></a> |
ffd31966 | 1449 | |
396d869e | 1450 | ### Step A: Metadata, Self-hosting and Interop |
ffd31966 | 1451 | |
90f618cb | 1452 | ![stepA_mal architecture](stepA_mal.png) |
ffd31966 | 1453 | |
bd62ff74 JM |
1454 | You have reached the final step of your mal implementation. This step |
1455 | is kind of a catchall for things that did not fit into other steps. | |
1456 | But most importantly, the changes you make in this step will unlock | |
1457 | the magical power known as "self-hosting". You might have noticed | |
1458 | that one of the languages that mal is implemented in is "mal". Any mal | |
1459 | implementation that is complete enough can run the mal implementation | |
1460 | of mal. You might need to pull out your hammock and ponder this for | |
1461 | a while if you have never built a compiler or interpreter before. Look | |
1462 | at the step source files for the mal implementation of mal (it is not | |
1463 | cheating now that you have reached step A). | |
1464 | ||
1465 | If you deferred the implementation of keywords, vectors and hash-maps, | |
1466 | now is the time to go back and implement them if you want your | |
1467 | implementation to self-host. | |
1468 | ||
ffd31966 JM |
1469 | Compare the pseudocode for step 9 and step A to get a basic idea of |
1470 | the changes that will be made during this step: | |
1471 | ``` | |
dbac60df | 1472 | diff -urp ../process/step9_try.txt ../process/stepA_mal.txt |
ffd31966 JM |
1473 | ``` |
1474 | ||
90f618cb | 1475 | * Copy `step9_try.qx` to `stepA_mal.qx`. |
ffd31966 | 1476 | |
396d869e JM |
1477 | * Add the `readline` core function. This functions takes a |
1478 | string that is used to prompt the user for input. The line of text | |
1479 | entered by the user is returned as a string. If the user sends an | |
1480 | end-of-file (usually Ctrl-D), then nil is returned. | |
1481 | ||
bd62ff74 JM |
1482 | * Add meta-data support to mal functions. TODO. Should be separate |
1483 | from the function macro flag. | |
1484 | ||
33e37b68 JM |
1485 | * Add a new "\*host-language\*" (symbol) entry to your REPL |
1486 | environment. The value of this entry should be a mal string | |
1487 | containing thename of the current implementation. | |
1488 | ||
1489 | * When the REPL starts up (as opposed to when it is called with | |
1490 | a script and/or arguments), call the `rep` function with this string | |
1491 | to print a startup header: | |
1492 | "(println (str \"Mal [\" *host-language* \"]\"))". | |
1493 | ||
bd62ff74 | 1494 | |
8f41f75a | 1495 | Now go to the top level, run the step A tests: |
bd62ff74 | 1496 | ``` |
e5737b08 | 1497 | make "test^quux^stepA" |
bd62ff74 JM |
1498 | ``` |
1499 | ||
1500 | Once you have passed all the non-optional step A tests, it is time to | |
1501 | try self-hosting. Run your step A implementation as normal, but use | |
1502 | the file argument mode you added in step 6 to run a each of the step | |
1503 | from the mal implementation: | |
1504 | ``` | |
1505 | ./stepA_mal.qx ../mal/step1_read_print.mal | |
1506 | ./stepA_mal.qx ../mal/step2_eval.mal | |
1507 | ... | |
1508 | ./stepA_mal.qx ../mal/step9_try.mal | |
1509 | ./stepA_mal.qx ../mal/stepA_mal.mal | |
1510 | ``` | |
1511 | ||
10a76646 | 1512 | There is a very good chance that you will encounter an error at some |
bd62ff74 JM |
1513 | point while trying to run the mal in mal implementation steps above. |
1514 | Debugging failures that happen while self-hosting is MUCH more | |
1515 | difficult and mind bending. One of the best approaches I have | |
cfdf00cc | 1516 | personally found is to add prn statements to the mal implementation |
bd62ff74 JM |
1517 | step (not your own implementation of mal) that is causing problems. |
1518 | ||
1519 | Another approach I have frequently used is to pull out the code from | |
1520 | the mal implementation that is causing the problem and simplify it | |
1521 | step by step until you have a simple piece of mal code that still | |
1522 | reproduces the problem. Once the reproducer is simple enough you will | |
1523 | probably know where in your own implementation that problem is likely | |
1524 | to be. Please add your simple reproducer as a test case so that future | |
1525 | implementers will fix similar issues in their code before they get to | |
1526 | self-hosting when it is much more difficult to track down and fix. | |
1527 | ||
1528 | Once you can manually run all the self-hosted steps, it is time to run | |
1529 | all the tests in self-hosted mode: | |
1530 | ``` | |
e5737b08 | 1531 | make MAL_IMPL=quux "test^mal" |
bd62ff74 JM |
1532 | ``` |
1533 | ||
1534 | When you run into problems (which you almost certainly will), use the | |
1535 | same process described above to debug them. | |
1536 | ||
1537 | Congratulations!!! When all the tests pass, you should pause for | |
1538 | a moment and consider what you have accomplished. You have implemented | |
1539 | a Lisp interpreter that is powerful and complete enough to run a large | |
1540 | mal program which is itself an implementation of the mal language. You | |
1541 | might even be asking if you can continue the "inception" by using your | |
1542 | implementation to run a mal implementation which itself runs the mal | |
1543 | implementation. | |
1544 | ||
4881701a | 1545 | |
dc791440 | 1546 | #### Optional: gensym |
4881701a DM |
1547 | |
1548 | The `or` macro we introduced at step 8 has a bug. It defines a | |
1549 | variable called `or_FIXME`, which "shadows" such a binding from the | |
1550 | user's code (which uses the macro). If a user has a variable called | |
1551 | `or_FIXME`, it cannot be used as an `or` macro argument. In order to | |
1552 | fix that, we'll introduce `gensym`: a function which returns a symbol | |
1553 | which was never used before anywhere in the program. This is also an | |
1554 | example for the use of mal atoms to keep state (the state here being | |
1555 | the number of symbols produced by `gensym` so far). | |
1556 | ||
1557 | Previously you used `rep` to define the `or` macro. Remove that | |
1558 | definition and use `rep` to define the new counter, `gensym` function | |
1559 | and the clean `or` macro. Here are the string arguments you need to | |
1560 | pass to `rep`: | |
1561 | ``` | |
1562 | "(def! *gensym-counter* (atom 0))" | |
1563 | ||
1564 | "(def! gensym (fn* [] (symbol (str \"G__\" (swap! *gensym-counter* (fn* [x] (+ 1 x)))))))" | |
1565 | ||
1566 | "(defmacro! or (fn* (& xs) (if (empty? xs) nil (if (= 1 (count xs)) (first xs) (let* (condvar (gensym)) `(let* (~condvar ~(first xs)) (if ~condvar ~condvar (or ~@(rest xs)))))))))" | |
1567 | ``` | |
1568 | ||
1569 | For extra information read [Peter Seibel's thorough discussion about | |
1570 | `gensym` and leaking macros in Common Lisp](http://www.gigamonkeys.com/book/macros-defining-your-own.html#plugging-the-leaks). | |
1571 | ||
1572 | ||
dc791440 | 1573 | #### Optional additions |
bd62ff74 JM |
1574 | |
1575 | * Add metadata support to composite data types, symbols and native | |
1576 | functions. TODO | |
50756494 DM |
1577 | * Add the following new core functions: |
1578 | * `time-ms`: takes no arguments and returns the number of | |
a85b8454 | 1579 | milliseconds since epoch (00:00:00 UTC January 1, 1970), or, if |
50756494 DM |
1580 | not possible, since another point in time (`time-ms` is usually |
1581 | used relatively to measure time durations). After `time-ms` is | |
1582 | implemented, you can run the mal implementation performance | |
1583 | benchmarks by running `make perf^quux`. | |
1584 | * `conj`: takes a collection and one or more elements as arguments | |
1585 | and returns a new collection which includes the original | |
1586 | collection and the new elements. If the collection is a list, a | |
1587 | new list is returned with the elements inserted at the start of | |
1588 | the given list in opposite order; if the collection is a vector, a | |
1589 | new vector is returned with the elements added to the end of the | |
1590 | given vector. | |
396d869e JM |
1591 | * `string?`: returns true if the parameter is a string. |
1592 | * `seq`: takes a list, vector, string, or nil. If an empty list, | |
1593 | empty vector, or empty string ("") is passed in then nil is | |
1594 | returned. Otherwise, a list is returned unchanged, a vector is | |
1595 | converted into a list, and a string is converted to a list that | |
1596 | containing the original string split into single character | |
1597 | strings. | |
ffd31966 JM |
1598 | |
1599 | ||
0f4ca9d1 JM |
1600 | ## TODO: |
1601 | ||
1602 | * simplify: "X argument (list element Y)" -> ast[Y] | |
0f4ca9d1 JM |
1603 | * list of types with metadata: list, vector, hash-map, mal functions |
1604 | * more clarity about when to peek and poke in read_list and read_form | |
1605 | * tokenizer: use first group rather than whole match (to eliminate | |
1606 | whitespace/commas) |