Ok, so maybe this is more a question for the superuser site but I figured there\'d be a hell of a lot more emacs users on stackoverflow.
I have the following 2 functions that I wish to combine into one: (defun fib (n) (if (= n 0) 0 (fib-r n 0 1)))
I have implemented a small lisp interpretor (sapid lisp at google code) in python and sapid lisp itself. Perhaps its main characteristic is to implement tail and mutual recursion optimization through
Im new to Scheme and trying to make function that is (in f u x), u is integer, x is a list and f binary function. The scheme expression (in + 3 \'(1 2 3)) should return 3+1+2+3=9.
According to CLHS entry for the INTERSECTION function (http://www.lispworks.com/documentation/HyperSpec/Body/f_isec_.htm):
(or (parse-integer (prompt-read \"Rating\") :junk-allowed t) 0) This line confuses me quite a bit. the full program is here if you need it to follow: http://paste.lisp.org/display/124929
I have been trying to get slimv (http://www.vim.org/scripts/script.php?script_id=2531) working for a while now, but I am really not sure what else I can do.
I\'m new to Common Lisp, and found myself taking advantage of way functions returns values. The following are to two trivial examples:
The following code will raise: SYSTEM::%E开发者_运维问答XPAND-FORM: (SETQ NUM (SUBSTRING LINE 6)) should be a lambda expression.
Now i have to copy the hastable to a list before sorting it: (defun good-red () (let ((tab (make-hash-table)) (res \'()))
加载中,请稍侯......