daniel-cussen

(defun converter (d20 d12 d10 d8 d4)
  (let ((prod (+ (* 3840 (1- d20))
		 (* 320 (1- d12)) 
		 (* 32 (1- d10)) 
		 (* 4 (1- d8)) 
		 (1- d4))))
    (if (> prod 65535)
	nil
	(format nil "~4,'0X" prod))))

daniel-cussen

> (apply #'append '((1 2) (3 4) (5 6)))

(1 2 3 4 5 6)

daniel-cussen

(defun flatten (x)
  (labels ((rec (x acc)
	     (cond ((null x) acc) 
		   ((atom x) (cons x acc))
		   ((null (car x)) (cons nil (rec (cdr x) acc)))
		   (t (rec (car x) (rec (cdr x) acc))))))     
    (rec x nil)))

daniel-cussen

(defun macro-caller (x y)
  (eval `(macro-in-question ,x ,y)))

daniel-cussen

CL-USER> (repl)
> ((label my-append (lambda (x y) (cond (eq '() x) y
					't (cons (car x) (my-append (cdr x) y)))))
   (cons '1 (cons '2 '()))
   (cons '3 (cons '4 '())))
(1 . (2 . (3 . (4 . NIL))))

daniel-cussen

;Lisp in Lisp in Golomb forests.  Includes use of linked lists.
;Based on Paul Graham's version of McCarthy's paper and code.
;Uses only eq, cond, atom, quote, cons, car, and cdr.

(defun null. (x)
  (eq x '()))

(defun and. (x y)
  (cond (x 
	 (cond (y 't)

daniel-cussen

(defun golomb-forest (&rest args)
  (if (and (oddp (length args)) (null (car (last args))))
      (sentinel-change. (golomb-forest-1 0 args))
      (golomb-forest-1 0 args)))

(defun golomb-forest-1 (size lst)
  (cond ((null lst) nil)
	((= size 0) (cons (car lst) (golomb-forest-1 1 (cdr lst))))
	(t (let ((siz (expt 2 size)))
	     (if (> siz (length lst))

daniel-cussen

CL-USER> (repl '((a . 1) (b . 2) (c . 3)))
> (cons a (cons b c))
(1 . (2 . 3))

daniel-cussen

> (cdr '(1 2 3))
((2 . 3) . NIL)

daniel-cussen

((label conser (lambda (x) (cons x x))) '1)