1
2
3
4
5
6
7
8
9
 
;;;======================================================
;;;   Wolf Test System
;;;
;;;     This expert system diagnoses some simple
;;;     problems with wolf.
;;;
;;;     CLIPS Version 6.3 Example
;;;
 ...

1
2
3
4
5
6
7
        (defun printread (&optional bylo42)
                (let (( num (read-from-string (or (read-line nil nil)"nil"))))
                        (cond 
                                ((null num) nil)
                                ((or bylo42 (eq num 42))(progn(printread t)))
                                (t (progn (format t "~A~%" num) (printread))))))
(printread)

1
2
3
4
5
6
7
(let ((bylo42 nil))
        (defun printread ()
                (let (( num (read-from-string (read-line))))
                        (if (and bylo42 (eq num 42))
                                (setf bylo42 t)
                                (format t "~A~%" num)))))
(printread)

1
2
3
4
5
6
7
8
9
;;;The following common lisp program is based on a solution given by
;;;Winston and Horn ("Lisp 3rd edition",1989, p.289, 538-539.)
;;;Significant improvements and alterations were made in all but the most
;;;primitive functions.  To run, simply load file and type (queen n) where
;;;n is the width of board.
 
;discovers if a piece threatens another
(defun threat (i j a b)
  (or (= i a)
 ...

1
(CDR ‘(((A) B)))

1
2
3
4
5
6
7
8
9
(defrule readin
        ?f<-(initial-fact)
=>
        (retract ?f)
        (assert (number (read)))
)
 
(defrule writeout
        ?f<-(number ?n)(test (<> ?n 42))
 ...

1
(+ 100 200)

1
(+ 1 2)

1
2
(setq ListeMoy '((Leon 10 13 16) (Marc 9 11) (Sophie 8 5 19)))
(print ListeMoy)

1
2
(setq ListeMoy '((Leon 10 13 16) (Marc 9 11) (Sophie 8 5 19)))
ListeMoy

1
(setq ListeMoy '((Leon 10 13 16) (Marc 9 11) (Sophie 8 5 19)))

1
(setq ListeMoy '((Leon 10 13 16) (Marc 9 11) (Sophie 8 5 19)))

1
2
3
4
5
6
7
8
9
(SETQ COLORS '(Hearts Diamonds Clubs Spades))
(SETQ NUMS '(6 7 8 9 10 J Q K A))
(SETQ seed (make-random-state T))
 
(defun CARTESIAN (x y)
        (MAPCAN #'(lambda (x)
                (MAPCAR #'(lambda (y)
                                  (list x y))
                        y))
 ...

1
( )

1
2
3
4
(defun factorial(n)
  (cons  ((zerop n) 1)
          (t (* n (factorial (- n 1))))))
          (factorial 5)

1
2
3
(defun factorial(n)
  (cons  ((zerop n) 1)
          (t (* n (factorial (- n 1))))))

1
2
3
(defun factorial(n)
  (cons  ((zerop n) 1)
          (t (* n (factorial (- n 1))))))

1
2
3
4
5
6
7
8
9
 
(deffacts a
   (pr hola)
)
 
(defrule prueba
  (pr ?a)
=>
  (printout t "hola " ?a)

1
2
3
4
5
6
7
8
#include <stdio.h>
main()
{
char c[5];
puts("what is u r name");
scanf("%s",&c);
printf("hello %s",c);
}

1
(+ 1 2)

1
2
3
4
5
(defrule red-light (light red) => (printout t "Stop" crlf))
(defrule green-light (light green) => (printout t "Go" crlf))
 
(assert (light red))
(run)

1
2
3
4
5
6
7
8
9
(deffacts szamok "Szamok"
(szam 1)
(osszeg 0)
(limit 1000)
(megoldas nincs)
)
 
(defrule oszthato "Limit alatt-oszthato"
    ?f1<-(szam ?x)
 ...

1
2
3
4
5
6
7
8
9
(deffacts szamok "Szamok"
(szam 1)
(osszeg 0)
(limit 1000)
(megoldas nincs)
)
 
(defrule oszthato "Limit alatt-oszthato"
    ?f1<-(szam ?x)
 ...

1
2
3
4
5
6
7
8
9
(deffacts szamok "Szamok"
(szam 1)
(osszeg 0)
(limit 1000)
(megoldas nincs)
)
 
(defrule oszthato "Limit alatt-oszthato"
    ?f1<-(szam ?x)
 ...

1
2
3
4
5
6
7
8
9
(deffacts szamok "Szamok"
(szam 1)
(osszeg 0)
(limit 1000)
(megoldas nincs)
)
 
(defrule oszthato "Limit alatt-oszthato"
    ?f1<-(szam ?x)
 ...

1
2
3
4
5
6
7
8
9
(deffacts szamok "Szamok"
(szam 1)
(osszeg 0)
(limit 1000)
(megoldas nincs)
)
 
(defrule oszthato "Limit alatt-oszthato"
    ?f1<-(szam ?x)
 ...

1
2
3
4
5
6
7
8
9
(deffacts szamok "Szamok"
(szam 1)
(osszeg 0)
(limit 1000)
(megoldas nincs)
)
 
(defrule oszthato "Limit alatt-oszthato"
    ?f1<-(szam ?x)
 ...

1
2
3
4
5
6
7
8
9
(defrule readin
        ?f<-(initial-fact)
=>
        (retract ?f)
        (assert (number (read)))
)
 
(defrule writeout
        ?f<-(number ?n)(test (<> ?n 42))
 ...

1
(+ 1 2 3 4)

1
(defun x 11)