I\'ve done the Graham Common Lisp Chapter 5 Exercise 5, which requires a function that takes an object X and a vector V, and returns a list of all the objects that immediately precede X in V.
Given a list, I\'m trying to return a new one that has only the items that appear more than once in the first list I receive as a parameter.
In Lisp, suppose I have these two rules in the knowledge base: (append nil ?x ?x) (<- (append (cons ?x ?l1) ?l2 (cons ?x ?l3))
I\'m trying to learn lisp and as i\'m making my first steps i got stuck. How can i get c element form following list:(a b (c.d))
There\'s a structure of the following format: (setq dist 开发者_如何学Python\'(((1 1) 1) ((0 2) 3)
开发者_运维问答As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references,or expertise, but this question will likely so
Long story: I am doing a project for my functional programing class, and I thought of writing an AI controller in Lisp, for the Mario AI competition.
I\'ve read through all the docume开发者_如何学Pythonntation, and most of the source of LFE.All the presentations emphasize basic lisp in traditional lisp roles - General Problem Solving, Hello world a
If I have a 开发者_运维问答list of 0\'s, how would I modify, for example, the 16th 0 in the list?You have to write it yourself. It is not built in to Scheme because it\'s not idiomatic and it can be b
Dear all, I now have a preliminary macro (defmacro key-if(test &key then else) `(cond (,test ,then)
加载中,请稍侯......