Implement TCO for cons cell toString

lisp/tail/length-recursion.lisp

@@ -0,0 +1,11 @@
+(load "../lang/functions.lisp")
+
+(defun build (n lst)
+  (if (= n 0) lst
+    (build (- n 1) (cons (car lst) lst))))
+
+(defun build2 (n lst)
+  (if (= n 0) lst
+    (build2 (- n 1) (build 200 lst))))
+
+(length (build2 200 (build2 200 (build2 200 (build2 200 '(1 1 1 1 0 0 0 0)))))) 

lisp/tail/to-string-recursion.lisp

@@ -8,4 +8,4 @@
   (if (= n 0) lst
     (build2 (- n 1) (build 200 lst))))
 
-(length (build2 200 (build2 200 '(1 1 1 1 0 0 0 0))))
+(build2 200 (build2 200 (build2 200 (build2 200 '(1 1 1 1 0 0 0 0)))))

src/sexpression/Cons.java

@@ -1,5 +1,10 @@
 package sexpression;
 
+import static recursion.tail.TailCalls.done;
+import static recursion.tail.TailCalls.tailCall;
+
+import recursion.tail.TailCall;
+
 @DisplayName("list")
 public class Cons extends SExpression {
 
@@ -34,16 +39,18 @@ public class Cons extends SExpression {
 
     @Override
     public String toString() {
-        return ("(" + toStringAux());
+        return toStringTailRecursive("(").invoke();
     }
 
-    private String toStringAux() {
+    private TailCall<String> toStringTailRecursive(String precedingString) {
-        if (rest.isNull())
+        String leadingString = precedingString + first.toString();
-            return (first.toString() + ")");
-        else if (rest.isCons())
-            return (first.toString() + " " + ((Cons) rest).toStringAux());
 
-        return (first.toString() + " . " + rest.toString() + ")");
+        if (rest.isNull())
+            return done(leadingString + ")");
+        else if (rest.isCons())
+            return tailCall(() -> ((Cons) rest).toStringTailRecursive(leadingString + " "));
+
+        return done(leadingString + " . " + rest.toString() + ")");
     }
 
 }