I seldom see static analyzer for functional programming languages, like Racket/Scheme, I even doubt 开发者_Python百科that whether there are any. I would like to write a static analyzer for functional
To practice my Haskell skills, I\'m following the Write Yourself a Scheme tutorial. I\'ve implemented a parser for s-expressions, but I\'m having trouble with the printing function.
I need to do something basically like this: (define test (λ (ls1 ls2) (cond ((empty? ls2) null) (else (append ls1 (car ls2)) (test ls1 (cdr ls2))) (displayln ls1))))
Edit: 开发者_如何学编程 (define leet-helper (lambda (string) (cond [(null? (string->list string)) \"\"]
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Javadoc can be used to automatically generate API documentation for Java code, using annotations in the comm开发者_运维技巧ents above each class, method, etc.
I know the basic algorithm for this problem but I am having trouble changing the sentence into a list inside my conditional. I created make-list to make it easier on myself but I\'m not sure where to
Im trying to implement Depth First Search in Scheme, but I can only get it to partially work. This is my code:
I am writing a function annotate that uses match-lambda often with recursive calls to annotate.Here is one of the patterns and matches:
I am trying to do some fairly complicated pattern matching using match-lambda.However I am having a lot of trouble deciphering the syntax for the patterns and the matches and Googling hasn\'t turned u
加载中,请稍侯......