Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Step 10: Proper Tail Calls | David Thompson | 2022-09-22 | 1 | -6/+98 |
| | |||||
* | Step 9: Closures | David Thompson | 2022-09-22 | 1 | -80/+252 |
| | | | | | This was a big one! Took me forever to wrap my head around the implementation but it's so cool now that it works! | ||||
* | Step 8: Procedure Calls | David Thompson | 2022-09-22 | 1 | -14/+109 |
| | |||||
* | Step 7: Heap Allocation | David Thompson | 2022-09-22 | 1 | -29/+216 |
| | | | | This one took me a looooong time to figure out. | ||||
* | Step 6: Conditional Expressions | David Thompson | 2022-09-22 | 1 | -3/+49 |
| | |||||
* | refactor: Define variables/procedures for registers/instructions. | David Thompson | 2022-09-22 | 1 | -44/+99 |
| | |||||
* | Step 5: Local Variables | David Thompson | 2022-09-22 | 1 | -36/+77 |
| | |||||
* | Use the proper 64 bit instructions. | David Thompson | 2022-09-22 | 1 | -31/+31 |
| | | | | | | The paper assumse a 32 bit machine and I didn't know anything about x86 assembly so I was naively using 32 bit registers and instructions. | ||||
* | Step 4: Binary Primitives | David Thompson | 2022-09-22 | 1 | -49/+121 |
| | |||||
* | Step 3: Unary Primitives | David Thompson | 2022-08-10 | 2 | -19/+150 |
| | |||||
* | Step 2: Immediate Constants | David Thompson | 2022-08-10 | 2 | -2/+44 |
| | |||||
* | Step 1: Integers | David Thompson | 2022-08-10 | 3 | -0/+30 |