I\'m writing a procedure which counts the number of zeros in a given list. This list could have another nested list.
at work I encountered a basic problem when trying to implement a configuration script with Scheme. To avoid the need of inventing an artificial and restricted language the script should contain actual
I want to write a procedure (function) that checks if a string contains another string. I read the documentation of string library from http://sicp.ai.mit.edu/Fall-2004/manuals/scheme-7.5.5/doc/sche开
This is extremely easy if I can 开发者_如何学编程use an array in imperative language or map (tree-structure) in C++ for example. In scheme, I have no idea how to start this idea? Can anyone help me on
This is the link that I\'m current teaching myself Scheme, http://www.ccs.neu.edu/home/dorai/t-y-开发者_StackOverflow中文版scheme/t-y-scheme-Z-H-1.html
Is it possible to do so? Let\'s say I want to get开发者_如何学JAVA the last element of a list, I would create a variable i = 0, and increment it until it equals to length. Any idea? An example would b
I use let to create a temporary variable, and then use this temporary variable in the next statement. However, DrScheme complained,
I\'m stuck in the middle of my project. I have开发者_开发问答 a list of lists like: \'((a for apple) (b is book) (c in cat) (ronn live in NY))
This is the function that removes the last element of the list. (define (remove-last ll) (if (null? (cdr ll))
Let\'s say I have a list: a b a a a c e. I want to get rid of all adjacent duplicate, i.e. the two a\'s in the middle. So the list becomes
加载中,请稍侯......