Revision as of 13:11, 9 June 2022 (view source) Cyril Nocton (talk \| contribs) m (→‎Control language) ← Older edit		Revision as of 23:59, 13 June 2022 (view source) Cyril Nocton (talk \| contribs) m (→‎Control language) Newer edit →
Line 2,395: The simpler the better. <lang lisp>~~(defun~~;; ~~run (table input state halt blank)~~22.06.14 ;; ask cyril.nocton:gmail.com▼ (defun run (table input state halt blank) (let (l (r input) rule op exec) (loop until (eql state halt) do (setf rule (cdr (assoc state table)) op 'null ~~exec~~x t) (dolist (symbol rule) (case symbol (= (setf ~~exec~~x (eql (car r) op))) (% (when ~~exec~~x (rplaca r op))) (< (when ~~exec~~x (push (pop l) r))) (> (when ~~exec~~x (push (pop r) l))) (@ (when ~~exec~~x (setf state op) (return))) (t (setf op symbol))) (unless (car r) (pop r) (push blank r)))) Line 2,432 ⟶ 2,433: That's all Folks ! ▲;;''cyril ~~ask~~nocton (cyril.nocton:@gmail.com'' =={{header\|Cowgol}}==

Universal Turing machine: Difference between revisions

Universal Turing machine (view source)