Added dist target, lowered recursion depth limit

scripts/fib.toy

@@ -4,7 +4,7 @@ fn fib(n : int) {
 	return fib(n-1) + fib(n-2);
 }
 
-for (var i = 0; i < 20; i++) {
+for (var i = 0; i <= 35; i++) {
 	var res = fib(i);
 	print string i + ": " + string res;
 }

scripts/test_sum/results.md

@@ -1,4 +0,0 @@
-C	0.002s	1
-JS	0.064s	32
-Py3	0.070s	35
-Toy	0.430s	215

scripts/test_sum/test_sum.c

@@ -1,22 +0,0 @@
-#include <stdio.h>
-
-//functions be local in C
-int sum(int n) {
-	if (n < 2) {
-		return n;
-	}
-
-	return n + sum(n - 1);
-}
-
-//the test case (C)
-void test_sum(int key, int val) {
-	const int result = sum(val);
-	printf("%d: %d\n", key, result);
-}
-
-int main() {
-	for (int i = 0; i <= 10; i++) {
-		test_sum(i, i * 1000);
-	}
-}

scripts/test_sum/test_sum.js

@@ -1,17 +0,0 @@
-//the test case (js)
-function test_sum(key, val) {
-    function sum(n) {
-        if (n < 2) {
-            return n;
-        }
-
-        return n + sum(n - 1);
-    }
-
-    const result = sum(val);
-    console.log(`${key}: ${result}`);
-}
-
-for (let i = 0; i <= 10; i++) {
-    test_sum(i, i * 1000);
-}

scripts/test_sum/test_sum.py

@@ -1,16 +0,0 @@
-import sys
-sys.setrecursionlimit(11000)
-
-#the test case (python)
-def test_sum(key: int, val: int):
-    def sum(n: int):
-        if n < 2:
-            return n
-        
-        return n + sum(n - 1)
-    
-    result: int = sum(val)
-    print(str(key) + ": " + str(result))
-
-for i in range(0, 10):
-    test_sum(i, i * 1000)

scripts/test_sum/test_sum.toy

@@ -1,17 +0,0 @@
-//the test case (toy)
-fn test_sum(key: int, val: int) {
-	fn sum(n: int) {
-		if (n < 2) {
-			return n;
-		}
-
-		return n + sum(n - 1);
-	}
-
-	var result: int const = sum(val);
-	print string key + ": " + string result;
-}
-
-for (var i: int = 0; i <= 10; i++) {
-	test_sum(i, i * 1000);
-}