factor/basis/compiler/tree
Slava Pestov f38d2f91f6 Words which didn't compile cannot be run at all 2009-04-20 22:05:41 -05:00
..
builder Words which didn't compile cannot be run at all 2009-04-20 22:05:41 -05:00
checker Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
cleanup use iota in a few places 2009-04-17 16:17:11 -05:00
combinators Add summary for heaps more vocabs 2009-02-16 21:05:13 -06:00
comparisons Stack effect declarations are mandatory on all words now 2009-02-23 20:27:05 -06:00
dead-code Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
debugger Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
def-use Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
escape-analysis Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
finalization Remove stupid commented out code 2009-03-12 17:30:33 -05:00
identities Add summary for heaps more vocabs 2009-02-16 21:05:13 -06:00
late-optimizations Add summary for heaps more vocabs 2009-02-16 21:05:13 -06:00
modular-arithmetic Add summary for heaps more vocabs 2009-02-16 21:05:13 -06:00
normalization Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
optimizer Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
propagation Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
recursive Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
tuple-unboxing Fixing unit tests for stack effect inference changes 2009-04-20 21:15:19 -05:00
authors.txt
summary.txt
tree.factor Trying to make PEGs compile faster by reducing the number of low level IR nodes: merge functionality of #>r and #r> into #shuffle, and generate 1 node instead of 3 for calls to get-local 2008-11-11 18:46:31 -06:00