Letq) f1 : {r:(); do[1000000;r,:($[(m:(1?10)[0]) > 5;m;0])];r} / somefunctionq) p1 : parse “r:(); do[1000000;r,:($[(m:(1?10)[0]) > 5;m;0])];r” /conform to body f1 parse treeq) p1 (“;”;(:;r;());(do;1000000;(,:;r;($;(\>;(:;m;((?;1;10);0));5);m;0)));r)q) … may be some transformations of parse tree …How to compile parse tree like p1 back to normal bytecode? Eval isslow about 2 times in this example.It is only interpret parse tree?:q) \t f1 1390q) \t eval p1 2875q) f2: {eval p1}q) \t f2 2875–Alexander Batalshikov.