X-Git-Url: https://git.gag.com/?a=blobdiff_plain;ds=sidebyside;f=src%2Flisp%2Fao_lisp_const.lisp;h=3c8fd21b73165a6c3d2bd95c40b5c73ddec010bb;hb=97cf9df882291b9e494b2f64f84eb37357a6ab31;hp=9d8af58862e1af43a7fb1c21fe005999cf56178a;hpb=974717eb9dad105c9897ee24f953d98d57eaec77;p=fw%2Faltos

diff --git a/src/lisp/ao_lisp_const.lisp b/src/lisp/ao_lisp_const.lisp
index 9d8af588..3c8fd21b 100644
--- a/src/lisp/ao_lisp_const.lisp
+++ b/src/lisp/ao_lisp_const.lisp
@@ -1,14 +1,21 @@
-					; basic list accessors
-
-
-(setq cadr (lambda (l) (car (cdr l))))
-(setq caddr (lambda (l) (car (cdr (cdr l)))))
-(setq list (lexpr (l) l))
-
-					; evaluate a list of sexprs
-
-;(setq progn (lexpr (l) (last l)))
-
+;
+; Copyright © 2016 Keith Packard <keithp@keithp.com>
+;
+; This program is free software; you can redistribute it and/or modify
+; it under the terms of the GNU General Public License as published by
+; the Free Software Foundation, either version 2 of the License, or
+; (at your option) any later version.
+;
+; This program is distributed in the hope that it will be useful, but
+; WITHOUT ANY WARRANTY; without even the implied warranty of
+; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+; General Public License for more details.
+;
+; Lisp code placed in ROM
+
+					; return a list containing all of the arguments
+
+(set (quote list) (lexpr (l) l))
 
 					;
 					; Define a variable without returning the value
@@ -16,24 +23,52 @@
 					; having lots of output generated
 					;
 
-(setq def (macro (def-param)
+(setq def (macro (name val rest)
 		 (list
 		  'progn
 		  (list
 		   'set
-		   (list
-		    'quote
-		    (car def-param))
-		   (cadr def-param)
-		   )
+		   (list 'quote name)
+		   val)
+		  (list 'quote name)
+		  )
+		 )
+      )
+
+					;
+					; A slightly more convenient form
+					; for defining lambdas.
+					;
+					; (defun <name> (<params>) s-exprs)
+					;
+
+(def defun (macro (name args exprs)
 		  (list
-		   'quote
-		   (car def-param)
+		   def
+		   name
+		   (cons 'lambda (cons args exprs))
 		   )
 		  )
-		 )
      )
 
+					; basic list accessors
+
+
+(defun cadr (l) (car (cdr l)))
+
+(defun caddr (l) (car (cdr (cdr l))))
+
+(defun nth (list n)
+  (cond ((= n 0) (car list))
+	((nth (cdr list) (1- n)))
+	)
+  )
+
+					; simple math operators
+
+(defun 1+ (x) (+ x 1))
+(defun 1- (x) (- x 1))
+
 					; define a set of local
 					; variables and then evaluate
 					; a list of sexprs
@@ -52,72 +87,61 @@
 					;
 					; (let ((x 1) (y)) (setq y (+ x 1)) y)
 
-(def let (macro (let-param)
-		((lambda (vars exprs make-names make-exprs make-nils)
-		   (progn
+(def let (macro (vars exprs)
+		((lambda (make-names make-exprs make-nils)
 
 					;
 					; make the list of names in the let
 					;
 
-		     (setq make-names (lambda (vars)
-				       (cond (vars
-					      (cons (car (car vars))
-						    (make-names (cdr vars))))
-					     )
-				       )
-			  )
-					;
+		   (setq make-names (lambda (vars)
+				      (cond (vars
+					     (cons (car (car vars))
+						   (make-names (cdr vars))))
+					    )
+				      )
+			 )
+
 					; the set of expressions is
 					; the list of set expressions
 					; pre-pended to the
 					; expressions to evaluate
-					;
-		     (setq make-exprs (lambda (vars exprs)
-				       (progn
-					 (cond (vars (cons
-						      (list set
-							    (list quote
-								  (car (car vars))
-								  )
-							    (cadr (car vars))
-							    )
-						      (make-exprs (cdr vars) exprs)
-						      )
-						     )
-					       (exprs)
-					       )
-					 )
-				       )
-			  )
-		     (setq exprs (make-exprs vars exprs))
 
-					;
-					; the parameters to the lambda is a list
-					; of nils of the right length
-					;
-		     (setq make-nils (lambda (vars)
-				      (cond (vars (cons nil (make-nils (cdr vars))))
+		   (setq make-exprs (lambda (vars exprs)
+				      (cond (vars (cons
+						   (list set
+							 (list quote
+							       (car (car vars))
+							       )
+							 (cadr (car vars))
+							 )
+						   (make-exprs (cdr vars) exprs)
+						   )
+						  )
+					    (exprs)
 					    )
 				      )
-			  )
-					;
+			 )
+
+					; the parameters to the lambda is a list
+					; of nils of the right length
+
+		   (setq make-nils (lambda (vars)
+				     (cond (vars (cons nil (make-nils (cdr vars))))
+					   )
+				     )
+			 )
+					; prepend the set operations
+					; to the expressions
+
+		   (setq exprs (make-exprs vars exprs))
+
 					; build the lambda.
-					;
-		     (cons
-		      (list
-		       'lambda
-		       (make-names vars)
-		       (cond ((cdr exprs) (cons 'progn exprs))
-			     ((car exprs))
-			     )
-		       )
-		      (make-nils vars)
-		      )
-		     )
+
+		   (cons (cons 'lambda (cons (make-names vars) exprs))
+			 (make-nils vars)
+			 )
 		   )
-		 (car let-param)
-		 (cdr let-param)
 		 ()
 		 ()
 		 ()
@@ -125,38 +149,36 @@
 		)
      )
 
-					;
-					; A slightly more convenient form
-					; for defining lambdas.
-					;
-					; (defun <name> (<params>) s-exprs)
-					;
+					; boolean operators
 
-(def defun (macro (defun-param)
-		    (let ((name (car defun-param))
-			  (args (cadr defun-param))
-			  (exprs (cdr (cdr defun-param))))
-		      (list
-		       def
-		       name
-		       (list
-			'lambda
-			args
-			(cond ((cdr exprs)
-			       (cons progn exprs))
-			      ((car exprs))
-			      )
-			)
-		       )
-		      )
-		    )
+(def or (lexpr (l)
+	       (let ((ret nil))
+		 (while l
+		   (cond ((setq ret (car l))
+			  (setq l nil))
+			 ((setq l (cdr l)))))
+		 ret
+		 )
+	       )
      )
 
-					; simple math operators
-					;
-					; Do these last to run defun
-					; at least once so the let macro
-					; is resolved
+					; execute to resolve macros
 
-(defun 1+ (x) (+ x 1))
-(defun 1- (x) (- x 1))
+(or nil t)
+
+(def and (lexpr (l)
+	       (let ((ret t))
+		 (while l
+		   (cond ((setq ret (car l))
+			  (setq l (cdr l)))
+			 ((setq ret (setq l nil)))
+			 )
+		   )
+		 ret
+		 )
+	       )
+     )
+
+					; execute to resolve macros
+
+(and t nil)