Universal Turing machine: Difference between revisions

Content added Content deleted

Inline

@@ Line 2,384: / Line 2,384: @@
   '>' : move right
   '@' : state <- op
-* : op <- *</pre>
+<symbol> : op <- symbol</pre>
 . Interpreter
@@ Line 2,395: / Line 2,395: @@
 <lang lisp>(defun run (table input state halt blank)
-  ;; bugs / questions : cyril nocton <cyril.nocton:gmail.com>
+;; help : cyril nocton <cyril.nocton:gmail.com>
-  (let (lStack (rStack input) rule operand match)
+  (let (lStack (rStack input) code operand match)
     (loop until (eql state halt) do
-      (setf rule (cdr (assoc state table)) operand 'null match t)
+      (setf code (cdr (assoc state table)) operand 'null match t)
-      (dolist (symbol rule)
+      (dolist (symbol code)
         (case symbol
           (= (setf match (eql (car rStack) operand)))