FP + slot). Accessing them via LOAD_L 0 reads memory directly without popping the evaluation stack, allowing LIFO push/pop math on top!
This saved bytecode machine uses integer address slots starting at one hundred, not physical byte addresses. STORE L zero takes the evaluation top and writes it at frame pointer plus zero. STORE L one writes at frame pointer plus one. The initial frame pointer one hundred therefore maps local zero to one hundred and local one to one hundred one. Both bars depict offsets zero and one on four hundred pixels per slot. Keep the frame base distinct from the relative offset. The basic locals preset explicitly stores ten and twenty, then loads both, adds, and stores thirty in local slot two. These bars show the two input values at twenty pixels per value unit: two hundred pixels for ten and four hundred for twenty. Addition changes the evaluation stack before the STORE instruction updates the local. This is the written simulator instruction sequence, not evidence of a particular compiled language implementation. CALL writes two metadata slots: return instruction index, then old frame pointer. It advances the stack pointer once for each and assigns the new frame pointer to that resulting position. An illustrative stack pointer one hundred one becomes frame pointer one hundred three. Bars show two metadata slots versus zero before call, at two hundred pixels per slot. RET reads the two saved slots, deletes the current frame region, restores stack pointer to current frame pointer minus two, and restores old frame and instruction pointers. The page models this contract, not native ABI or memory safety.