LispForum

A small modification to function in "ANSI Common Lisp".

I find this a fascinating subject. But there seem to be so many dead ends. Here is a page I found some time back with Lisp OSes. There are many dead projects mixed in if I remeber correctly. http://linuxfinances.info/info/lisposes.html This one seems very interesting. http://common-lisp.net/project/...

You dont need the embedded defun dividetwo-iter. I looks like you are trying to have a local funtion via the embedded defun. This would be accomplished with the labels form. (defun name (x) (labels ((fun-name (var-a var-b) (+ a b))) (fun-name x 10)) The way you have it would end up redefining the gl...

I have programmed in Turbo Pascal, Basic, Visual Basic, Java, C, and Common Lisp (not that I got good at any of them). I would say that Lisp blows them all away in terms of thinking about a program through the tools of a progamming language. Its funny that when I talk to programmers trained on more ...

If you used only the defined structure interface functions, that would be correct. In the insert function group, there is a function called BST-leaf-insert. If you use the convention (make-bin-tree-node reference-element left-tree right-tree), Notice that the reference element in the node created is...

I remember I had a problem with this once. I tried editing the file, but then another error popped up, then another (either another package not found or another file didnt find the ASDF package, dont remeber.). I didnt chase it down too far though. You can try installing slime from the website, or f...

I seems the function BST-node-remove returns the right node in that case.

E is removed because it is excluded from the reconstructed tree.

This is turning out to be alot tougher then I thought. I want to make the syntax better. I have the concepts, but implemeting them is really hard. For example, the following defun plus (a,b) {a + b} defun minus (a,b) {a - b} Could be implemented if the {} are interpreted to mean a list with the open...

Thank you for the feedback. Sweet-expressions looks really interesting. I think that after implementing this, I can give that a serious look. (after all, one of the reasons I like lisp is that I like to learn first hand by implenting things). The way their expressions look are so much better then wh...

To help understand what #'BST-node-remove is doing, try to see the following patterns. *Since the tree is sorted, the program determines to search either the (<= remove-this node-referece) sub-tree, or the (> remove-this node-reference) sub-tree. *If when checking the left tree, the right-tree is re...