John Lorentzson
ea31bac351
It was previously decided that, since the language is not to be Turing-complete, a loop that takes a variable for its upper bound should use the variable's value at the time of the loop's start, not look it up. I forgot this while writing the syntax->IR compiler, so loops with non-constant stop counts failed to compile. |
||
|---|---|---|
| .. | ||
| compile-node-to-ir.lisp | ||
| data.lisp | ||
| graph-manipulation.lisp | ||
| instructions.lisp | ||
| jigs.lisp | ||
| optimizations.lisp | ||
| structure.lisp | ||