summaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Step 10: Proper Tail CallsDavid Thompson2022-09-221-6/+98
|
* Step 9: ClosuresDavid Thompson2022-09-221-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 CallsDavid Thompson2022-09-221-14/+109
|
* Step 7: Heap AllocationDavid Thompson2022-09-221-29/+216
| | | | This one took me a looooong time to figure out.
* Step 6: Conditional ExpressionsDavid Thompson2022-09-221-3/+49
|
* refactor: Define variables/procedures for registers/instructions.David Thompson2022-09-221-44/+99
|
* Step 5: Local VariablesDavid Thompson2022-09-221-36/+77
|
* Use the proper 64 bit instructions.David Thompson2022-09-221-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 PrimitivesDavid Thompson2022-09-221-49/+121
|
* Step 3: Unary PrimitivesDavid Thompson2022-08-102-19/+150
|
* Step 2: Immediate ConstantsDavid Thompson2022-08-102-2/+44
|
* Step 1: IntegersDavid Thompson2022-08-103-0/+30