1 IN: compiler.tree.normalization.tests
2 USING: compiler.tree.builder compiler.tree.normalization
3 compiler.tree sequences accessors tools.test kernel math ;
5 \ count-introductions must-infer
8 [ 3 ] [ [ 3drop 1 2 3 ] build-tree count-introductions ] unit-test
10 [ 4 ] [ [ 3drop 1 2 3 3drop drop ] build-tree count-introductions ] unit-test
12 [ 3 ] [ [ [ drop ] [ 2drop 3 ] if ] build-tree count-introductions ] unit-test
14 [ 2 ] [ [ 3 [ drop ] [ 2drop 3 ] if ] build-tree count-introductions ] unit-test
16 : foo ( -- ) swap ; inline recursive
18 : recursive-inputs ( nodes -- n )
19 [ #recursive? ] find nip child>> first in-d>> length ;
24 [ normalize recursive-inputs ] bi
27 [ ] [ [ [ 1 ] [ 2 ] if + * ] build-tree normalize drop ] unit-test
30 : aaa ( x -- ) dup [ dup >r bbb r> aaa ] [ drop ] if ; inline recursive
31 : bbb ( x -- ) >r drop 0 r> aaa ; inline recursive
33 [ ] [ [ bbb ] build-tree normalize drop ] unit-test
35 : ccc ( -- ) ccc drop 1 ; inline recursive
37 [ ] [ [ ccc ] build-tree normalize drop ] unit-test
40 : ddd ( -- ) eee ; inline recursive
41 : eee ( -- ) swap ddd ; inline recursive
43 [ ] [ [ eee ] build-tree normalize drop ] unit-test