A-M baby

Task/Mutual-recursion/Aime/mutual-recursion.aime

@@ -0,0 +1,42 @@
+integer F(integer n);
+integer M(integer n);
+
+integer F(integer n)
+{
+    integer r;
+    if (n) {
+	r = n - M(F(n - 1));
+    } else {
+	r = 1;
+    }
+    return r;
+}
+
+integer M(integer n)
+{
+    integer r;
+    if (n) {
+	r = n - F(M(n - 1));
+    } else {
+	r = 0;
+    }
+    return r;
+}
+
+integer main(void)
+{
+    integer i;
+    i = 0;
+    while (i < 20) {
+	o_winteger(3, F(i));
+	i += 1;
+    }
+    o_byte('\n');
+    i = 0;
+    while (i < 20) {
+	o_winteger(3, M(i));
+	i += 1;
+    }
+    o_byte('\n');
+    return 0;
+}