1 IN: compiler.tree.normalization.tests
2 USING: compiler.tree.builder compiler.tree.normalization
3 compiler.tree compiler.tree.checker
4 sequences accessors tools.test kernel math ;
6 \ count-introductions must-infer
9 [ 3 ] [ [ 3drop 1 2 3 ] build-tree count-introductions ] unit-test
11 [ 4 ] [ [ 3drop 1 2 3 3drop drop ] build-tree count-introductions ] unit-test
13 [ 3 ] [ [ [ drop ] [ 2drop 3 ] if ] build-tree count-introductions ] unit-test
15 [ 2 ] [ [ 3 [ drop ] [ 2drop 3 ] if ] build-tree count-introductions ] unit-test
17 : foo ( -- ) swap ; inline recursive
19 : recursive-inputs ( nodes -- n )
20 [ #recursive? ] find nip child>> first in-d>> length ;
25 [ normalize recursive-inputs ] bi
28 [ ] [ [ [ 1 ] [ 2 ] if + * ] build-tree normalize check-nodes ] unit-test
31 : aaa ( x -- ) dup [ dup >r bbb r> aaa ] [ drop ] if ; inline recursive
32 : bbb ( x -- ) >r drop 0 r> aaa ; inline recursive
34 [ ] [ [ bbb ] build-tree normalize check-nodes ] unit-test
36 : ccc ( -- ) ccc drop 1 ; inline recursive
38 [ ] [ [ ccc ] build-tree normalize check-nodes ] unit-test
41 : ddd ( -- ) eee ; inline recursive
42 : eee ( -- ) swap ddd ; inline recursive
44 [ ] [ [ eee ] build-tree normalize check-nodes ] unit-test
46 : call-recursive-5 ( -- ) call-recursive-5 ; inline recursive
48 [ ] [ [ call-recursive-5 swap ] build-tree normalize check-nodes ] unit-test