Execute Brain****/Common Lisp: Difference between revisions

m
Fixed syntax highlighting.
m ((float edit in strange pos, ... fixed?))
m (Fixed syntax highlighting.)
 
(5 intermediate revisions by 4 users not shown)
Line 1:
{{implementation|Brainf***}}{{collection|RCBF}}
 
This is an implementation of [[Brainf***]] written in [[Common Lisp]].
=={{header|Common Lisp}}==
 
<lang lisp>(defstruct bf-state
<syntaxhighlight lang="lisp">(defstruct bf-state
(program)
(program-counter 0)
(memory (make-array 1 :initial-element 0 :adjustable t))
(memory-pointer 0))
(stack))
 
(defmacro with-bf-slots ((program-sym program-counter-sym
(defun adjust-memory (state)
memory-sym memory-pointer-sym
"Modifies memory and memory-pointer such that memory-pointer is
stack-sym)
a valid index to the memory array. If it is too large, the array
obj-expr &body body)
is extended; if it is negative, the array is extended, its
"Macro to replace cumbersome structure slot references with
contents are shifted forward and the memory-pointer is incremented,
local lexical macros resembling local variables."
by an amount to make the memory ."
`(condsymbol-macrolet ((>=,program-sym (bf-state-memory-pointerprogram state,obj-expr))
(length,program-counter-sym (bf-state-memoryprogram-counter state),obj-expr))
(adjust,memory-arraysym (bf-state-memory state,obj-expr))
(1+,memory-pointer-sym (bf-state-memory-pointer state,obj-expr))
(,stack-sym :initial(bf-elementstate-stack 0,obj-expr)))
,@body))
((minusp (bf-state-memory-pointer state))
(let ((extent (- (bf-state-memory-pointer state))))
(incf (bf-state-memory-pointer state) extent)
(let ((old-memory (copy-seq (bf-state-memory state))))
(setf (bf-state-memory state)
(make-array (+ (length old-memory) extent)))
(setf (subseq (bf-state-memory state) extent)
old-memory))))))
 
(defun adjust-memory (state)
"Modifies memory and memory-pointer such that memory-pointer is
a valid index to the memory array. If it is too large, the array
is extended; if it is negative, the array is extended, its
contents are shifted forward and the memory-pointer is incremented,
by an amount to make the memory ."
(with-bf-slots (program pc mem ptr stack) state
(cond ((>= ptr (length mem))
(adjust-array mem (1+ ptr) :initial-element 0))
((minusp ptr)
(let ((extent (- ptr)))
(incf ptr extent)
(let ((old-memory (copy-seq mem)))
(setf mem (make-array (+ (length old-memory) extent)))
(setf (subseq mem extent) old-memory)))))))
(defun matching-bracket-for (program bracket-index)
(loop with depth := 01
for index := bracket-index thenfrom (1+ bracket-index)
when (>= index (length program))
do (error "unmatched [ bracket")
whendo (char= #\[case (eltaref program index))
do (#\[ (incf depth))
when (char= (#\] (elt programdecf indexdepth)))
do (decf depth)
until (zerop depth)
finally (return index)))
 
(defun brainfuck-eval (state &optional (stream *standard-output*))
(let ((program (bf-state-program state))
(places nil))
(loop while (< (bf-state-program-counter state) (length program)) do
(case (elt program (bf-state-program-counter state))
(#\+ (incf (elt (bf-state-memory state) (bf-state-memory-pointer state))))
(#\- (decf (elt (bf-state-memory state) (bf-state-memory-pointer state))))
(#\> (incf (bf-state-memory-pointer state)) (adjust-memory state))
(#\< (decf (bf-state-memory-pointer state)) (adjust-memory state))
(#\[ (if (/= 0 (elt (bf-state-memory state) (bf-state-memory-pointer state)))
(push (1- (bf-state-program-counter state)) places)
(setf (bf-state-program-counter state)
(matching-bracket-for program (bf-state-program-counter state)))))
(#\] (setf (bf-state-program-counter state) (pop places)))
(#\. (write-char (code-char (elt (bf-state-memory state)
(bf-state-memory-pointer state)))
stream)))
(incf (bf-state-program-counter state)))))
(defun bf (program) (brainfuck-eval (make-bf-state :program&optional program)(stream *standard-output*))
(with-bf-slots (program pc mem ptr stack) state
(loop while (< pc (length program)) do
(case (aref program pc)
(#\+ (incf (aref mem ptr)))
(#\- (decf (aref mem ptr)))
(#\> (incf ptr) (adjust-memory state))
(#\< (decf ptr) (adjust-memory state))
(#\[ (if (/= 0 (aref mem ptr))
(push (1- pc) stack)
(setf pc (matching-bracket-for program pc))))
(#\] (setf pc (pop stack)))
(#\. (write-char (code-char (aref mem ptr)) stream)))
(incf pc))))
 
(defun brainfuck-compile-guts (program &optional (start 0) (until-bracket nil))
(loop for insn from start below (length program)
appending (case (aref program insn)
(#\+ `((incf (aref mem ptr))))
(#\- `((decf (aref mem ptr))))
(#\> `((incf ptr) (adjust-memory state)))
(#\< `((decf ptr) (adjust-memory state)))
(#\[ (let ((end (matching-bracket-for program insn)))
(prog1
`((do () ((= 0 (aref mem ptr)))
,@(brainfuck-compile-guts program (1+ insn) end)))
(setf insn end))))
(#\] (if until-bracket
(if (= until-bracket insn)
(loop-finish)
(error "internal problem matching brackets"))
(error "extra ] bracket")))
(#\. `((write-char (code-char (aref mem ptr)) stream))))))
(defun brainfuck-compile (program)
(compile nil `(lambda (&optional (stream *standard-output*))
(let ((state (make-bf-state :program ,program)))
(with-bf-slots (program pc mem ptr stack) state
,@(brainfuck-compile-guts program))
(values)))))
 
(defun bf (program)
(if (and (not (zerop (length program)))
(char= #\! (aref program 0)))
(funcall (brainfuck-compile program))
(brainfuck-eval (make-bf-state :program program))))
(defun bf-repl ()
"read-eval-print loop for bf. Code prefixed with ! is compiled, otherwise interpreted"
(loop do (fresh-line)
(princ "BRAINFUCK> ")
(bf (read-line))))</langsyntaxhighlight>
9,476

edits