Common LISP Code Samples

Red-Black-trees

Below are two pieces of lisp-code, which implement insertion, find and deletion in red-black-trees. The algorithm for insertion is taken from a C source I found in the internet, the deletion algorithm I developed originally. Both programs contain some testbed-code which you can delete as it is probably not of much use elsewhere.

Program A uses CLOS, Program B is implemented with structs instead, leading two a fourfold increase in execution speed. At the moment only Program B contains the find and deletion code.

Program A

Program B

New:

As I plan to write a polynomial manipulation program based on red-black-tree represented polynomials I started overhauling Program B, first by splitting it up into separate files, for reasons explained in a (yet to write) CHANGES file.

You can download this new Program B as

polynomials.tar.gz

Of course you have to unpack it as usual with tar -xvzf polynomials.tar.gz

A LL(1) Parser generator

A simplistic LL(1)-Parser generator is currently under development. It can be found in parser-gen.lisp

Exporting Opera bookmarks to Netscape/Mozilla

bookmarkprocess.lisp contains functions for importing Opera bookmarks, selecting subsets from them and exporting to Netscape.

Other code samples

If you want to see some other (little) lisp programs I wrote up to now, look at this directory of lisp code.

A small wish in big print:

If you do more with the code here than just glance over it:

Please send me a short e-mail (jboehm@gmx.net) with some comments on it (for example suggestions on further development).

- I notice in the logs that the codes are GET from time to time, but never received any comment. It would be somewhat encouraging to receive feedback, as I sometimes ask myself why to keep this site up if nobody seems to take any use from it -