LispForum

I have to do in lisp, algorithm of simple preceding. Here I found some links with information about Simple Precedence Grammars, but I do not understand how to do this in CLISP. Here's a link Here's another link May you have some ideas how to do this in CLISP, even in pseudocode. Thanks in advance!

I have a list (SetQ L '(1 j 3 k 4 h 5 n 6 w)) I have to do a function Order that has a list with 'n' atoms at entry, it must check if each atom of that list is contained in list L and order them according to the order specified in list L, if the atom is not part of the list L then the result will be...

I have a list (SetQ List '(1 j 3 k 4 h 5 n 6 w)) I need to do a function Verify that will verify if the first atom is before the 2nd. I want to verify this: > Verify(3 k) result should return > T // because atom '3' is anywhere before atom 'k' And in this case : > Verify(h 4) result should return > ...