Advanced
- 1.Why Bytecode? From Tree-Walking to a Virtual Machine
- 2.Chunks, Opcodes & a Stack-Based VM
- 3.Compiling Expressions to Bytecode
- 4.Global and Local Variables in Bytecode
- 5.Control Flow & Jumps in Bytecode
- 6.Functions & Call Frames
- 7.Closures & Upvalues in a Bytecode VM
- 8.Garbage Collection: Mark-and-Sweep
- 9.Classes, Instances & Method Dispatch in Bytecode
- 10.Capstone: Benchmarking Wisp — Tree-Walking vs. Bytecode VM
Read as One Page
PDF Downloads
Exercise Solutions
compiler2-1_challenge1.txtcompiler2-1_challenge2.txtcompiler2-1_challenge3.txtcompiler2-2_challenge1.txtcompiler2-2_challenge2.txtcompiler2-2_challenge3.txtcompiler2-3_challenge1.txtcompiler2-3_challenge2.txtcompiler2-3_challenge3.txtcompiler2-4_challenge1.txtcompiler2-4_challenge2.txtcompiler2-4_challenge3.txtcompiler2-5_challenge1.txtcompiler2-5_challenge2.txtcompiler2-5_challenge3.txtcompiler2-6_challenge1.txtcompiler2-6_challenge2.txtcompiler2-6_challenge3.txtcompiler2-7_challenge1.txtcompiler2-7_challenge2.txtcompiler2-7_challenge3.txtcompiler2-8_challenge1.txtcompiler2-8_challenge2.txtcompiler2-8_challenge3.txtcompiler2-9_challenge1.txtcompiler2-9_challenge2.txtcompiler2-9_challenge3.txt