[cs-lisp] re:4: defun kullanmayi denemistim zaten..
(defun akor-salla (let* ((t (random 116)) (m (+ t (random 3) 2)) (d (+ t (random 3) 5))) (list t m d))) AKOR-SALLA CG-USER(3): (akor-salla) Error: AKOR-SALLA got 0 args, wanted 3 args. ||defun kullan cevabinin sonucu.|| __ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com ___ cs-lisp mailing list cs-lisp@cs.bilgi.edu.tr http://church.cs.bilgi.edu.tr/lcg http://cs.bilgi.edu.tr/mailman/listinfo/cs-lisp
[cs-lisp] sual 4; degiskensiz fonksiyon tanimlama?
(define (akor-salla) (let* ((t (random 116)) (m (+ t (random 3) 2)) (d (+ t (random 3) 5))) (list t m d))) Bunu PLT Scheme ..module de calistirabiliyorum. Peki define yerine CL'de hangi macro'yu kullanabirim. __ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com ___ cs-lisp mailing list cs-lisp@cs.bilgi.edu.tr http://church.cs.bilgi.edu.tr/lcg http://cs.bilgi.edu.tr/mailman/listinfo/cs-lisp
[cs-lisp] sual 3
Listemi islemden gecirip her bir elemaninin basina sira no'sunu nasil ekleyebilirim. __ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com ___ cs-lisp mailing list cs-lisp@cs.bilgi.edu.tr http://church.cs.bilgi.edu.tr/lcg http://cs.bilgi.edu.tr/mailman/listinfo/cs-lisp
[cs-lisp] recursive function
I try to replace some elements of a list through using recursive function; but i cannot. Can you advise me? Function: replace a with e, and b with d. (defun replace (lst) (cond ((null lst) 1) ((eq lst 'a) 'e) ((eq lst 'b) 'd) (t (cons ((car (lst)) (replace (cdr lst))) What is wrong with that code? __ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com ___ cs-lisp mailing list cs-lisp@cs.bilgi.edu.tr http://church.cs.bilgi.edu.tr/lcg http://cs.bilgi.edu.tr/mailman/listinfo/cs-lisp
[cs-lisp] recursive and 'prog'
I want to write a function using recursive function, which prints the first let's say 15 cubes (1, 8, 27, 64..). H o w ? How could it be with non-recursive function? __ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com ___ cs-lisp mailing list cs-lisp@cs.bilgi.edu.tr http://church.cs.bilgi.edu.tr/lcg http://cs.bilgi.edu.tr/mailman/listinfo/cs-lisp
