I\'m trying to solve this problem. I was wondering if someone would help get started on it or give me some hints.
I tested the following code in Racket/DrScheme: (define (makem) (define x 34) (list (lambda () (set! x (+ x 1)) x)
I am working on a toy language that compiles to C++ based on lisp (very small subset of scheme), I am trying to figure out how to represent let expression,
I\'ve been trying to solve this problem for hours. function expand that takes a list of elements and frequencies and expands them into a simple list. For example, the result of (expand \'(a (3 b) (3 a
I am confused by the terms for a long time, thinking it is good to ask out what exactly do they mean:
What is an example of a recursive function to compute all possible combinations of lists?For example, (combine (list 1 2 3) (list 1 2)) should return \'((开发者_JS百科1 1) (1 2) (2 1) (2 2) (3 1) (3 2
Hi What is sequenc开发者_JAVA技巧e in Lisp ? and what is difference between sequence and list in Lisp ?
I am trying to write a wrapper for define, that stores the values passed to it.I\'ve been approaching it in baby steps (being new to Lisp in general, and even newer to Scheme) but have run into a wall
I had a question about a program I\'ve been trying to get running. Encrypt takes a message, public-key, and private-key, and returns the message with the letters from the message in the public-key ch
I need to help extending the Charme interpreter and de开发者_高级运维fining the null and null? primitives that behave similarly to the primitive Scheme procedures. I know I can use Python\'s None valu
加载中,请稍侯......