LispForum

saulgoode

Do I have to convert the string into the list and then back again to make the code work or should I try to reverse the string as a string? While not necessary, it would certainly simplify things. Accumulative recursion just means that an extra parameter is passed to your function each time it is ca...

saulgoode

The same code works with Guile (substituting for the square brackets):

Code: Select all

(define-syntax setvar
  (syntax-rules ()
    ((setvar var value)
      (define var value) )))

saulgoode

I would break the big picture down into three different parts. There are the Algol-like imperative languages in which the main paradigm is to pass arguments to a function. Then there is the Lisp family where functions are applied to a set of arguments. And then there are the object-oriented language...

saulgoode

*If N is returned, then the element was not found in the tree. It's this part that confuses me. It seems like N could be returned if elmt = E. If the left branch of N is a leaf then, by the convention adopted, that leaf's element is equal to N's element (and so if the element of that leaf is equal ...

saulgoode

sylwester wrote:Why do we have incf/decf if not for speed?

For code readability/conciseness?

Try writing the 'setf' equivalent to

(incf (aref myarray (incf indx)))

saulgoode

Anyways, I am arguing that his definition of what "simpler" is is rather ambiguous. does simpler mean an answer with the least characters? Because by that logic a much much simpler solution would have been: >'8 or does simpler mean speed, or memory efficiency? If both answers are equivale...

saulgoode

Could you post the code you are using?

saulgoode

There are some LISP extensions on the Emacs wiki which might serve as a basis for generating your own predetermined random numbers. But otherwise I think you are out of luck.

saulgoode

The author appears to be using some slightly non-standard symbols, but nothing that is not easily corrected.

Try defining the following equivalents before running the code:

Code: Select all

(define null nil)
(define true #t)
(define false #f)

saulgoode

I would recommend spending a little time with How To Design Programs which is based on the Scheme dialect ("DrScheme" to be precise). It will probably start out a little too simplistic given your experience level, but it is quick way to get started without have to learn a lot of different ...

LispForum

Search found 45 matches

Re: Help with scheme code.

Re: Macros

Re: Whats your view of Lisp in the large picture?

Re: please help me understand this lisp function

Re: (incf x) slower than (setf x (+ x 1))?

Re: What does clisp do behind the scene if you give it (* 2 2 2)

Re: Help with result printing

Re: Seeding PRNG

Re: Cracker Barrel Game Solution

Re: Which Lisp?