Each transient identifies the value of the corresponding previous bytecode. This change (a) frees up many bytecodes formerly used by the conditional expression (if c t f); (b) regularizes the bytecode by always placing opcodes before operands; and (c) causes the bytecode to conform to the Single Static Assignment (SSA) form preferred by e.g. LLVM. Includes updates to the hand-assembled files (*.rla) and the bytecode compiler. |
||
|---|---|---|
| .. | ||
| bytecode.txt | ||
| translation.txt | ||