Consider the following BNF defining trees of numbers. Notice that a tree can ei开发者_StackOverflow社区ther be a leaf, a node-1 with one subtrees, or a node-2
PLT Scheme guide says that it\'s implemented sort function is able to sort a list according to an extarcted value using a lambda function. link text
According to SICP section 1.2.6, exercise 1.22: Most Lisp implementations include a primitive called runtime that returns an integer that specifies the amount of time the system has been running (me
I\'m trying to work my way through Compilers: Backend to Frontend (and Back to Front Again) by Abdulaziz Ghuloum. It seems abbreviated from what one would expect in a full course/seminar, so I\'m tryi
I am trying to put the following statement in Dr.Scheme: {with {x {+ 5 5}} {+ x x}} but I got an error:
After having got through the two Schemer books, I\'m about to embark on HtDP but also discovered the http://docs.plt-scheme.org/guide material.
Something simple as this: Welcome to DrScheme, version 4.2.3 [3m]. Language: Lazy Scheme; memory limit: 128 megabytes.
(defspel game-action (command subj obj place &rest rest) `(defspel ,command (subject object) `(cond ((and (eq *location* \',\',place)
I have been working alongside The Little Schemer to learn Scheme and using PLT-Scheme for my environment.
I\'ve written a function to get the maximum value from a list of nested lists, I have the general form of the function down right; it works on flat lists and nested lists but seems to fail when there
加载中,请稍侯......