scheme

Can anyone tell me something about this file? As I know: Common-Lisp and Scheme are both dialects of lisp. Common-Lisp source file *.lisp can be compiled into binary file *.fasl which can be loaded faster than the source file. Q:Can the Scheme source code *.scm be compiled into some binary file that will be loaded faster than the source code? Thanks in advance, joe Yes, if the Scheme implementation you're using has that feature. FASL in Racket: http://docs.racket-lang.org/reference/fasl.html FASL in Chez Scheme: http://www.scheme.com/csug8/io.html#./io:h15 Alternatively, you could compile your

I'm just playing with an NFA for string recognition. I have a macro that creates a function which consumes input and passes on the rest to some other functions. Because there might be loops in my NFA graph, I'm using letrec to put the whole thing together. Here is some code (been testing in PLT-Scheme): (define-syntax-rule (match chars next accepting) ; a function that consumes a list of chars from a list l. ; on success (if there's more to do) invokes each of next on the remainder of l. (lambda (l) (let loop ((c chars) (s l)) (cond ((empty? c) (cond ((and (empty? s) accepting) #t) (else

I saw there are other questions about the dot "." I followed but it didn't work for my code.... it's a part of code, the implementation is not focused to this symbol. but output should be included this dot. when I give input of two lists '(1 2 3) '(4 5) my expected output => (1 . 4) (2 . 5) I managed to get (1 4) (2 5) just need to add "." in the middle. Part of mycode (cons (list (car lst1) (car lst2)) .... for the "." symbol , if I try **trial-1** (cons '(list (car lst1) (car lst2)) ...) then the output : ((list (car lst1) (car lst2)) **trail-2** (cons (list (car lst1) '. (car lst2)) ...)

I wrote the following code in scheme today, but the evaluation is wrong. Please don't tell me I suck at programming, I understand that this is a classic recursion problem, but I am having trouble with it: (define (towers-of-hanoi n source temp dest) (if (= n 1) (begin (display "Move the disk from ") (display source) (display " to " ) (display dest) (newline)) (begin (towers-of-hanoi (- n 1) source temp dest) (display "Move the disk from ") (display source) (display " to ") (display dest) (newline) (towers-of-hanoi(- n 1) temp source dest)))) I expected the code to work, and when I debug it I

I want to see how long a function takes to run. What's the easiest way to do this in PLT-Scheme? Ideally I'd want to be able to do something like this: > (define (loopy times) (if (zero? times) 0 (loopy (sub1 times)))) > (loopy 5000000) 0 ;(after about a second) > (timed (loopy 5000000)) Took: 0.93 seconds 0 > It doesn't matter if I'd have to use some other syntax like (timed loopy 5000000) or (timed '(loopy 5000000)) , or if it returns the time taken in a cons or something. The standard name for timing the execution of expressions in most Scheme implementations is "time". Here is an example

Closed. This question is off-topic . It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 5 years ago . I am trying to interpret what this scheme function does: (define (y s lis) (cond ((null? lis) '() ) ((equal? s (car lis)) lis) (else (y s (cdr lis))))) It runs but I am not exactly sure what it is doing or trying to do. Does it need a list to sort or something? I am using DrRacket to run it. I have never seen scheme before and any help would be greatly appreciated. It's a search function, that given a value and

写这篇文章的原因 在移动端一般很少使用复杂的表单，一般针对于属性的更改都会打开一个新的页面进行更改。虽然不多，但是也会有。如果一个页面要输入的内容包括姓名、地址、邮箱、手机号等，对各个属性的验证会非常麻烦，并且非常的不优雅。 于是， saripaar 就出现了，一种基于规则的 Android UI 输入验证库，通过注解即可标注验证规则。 使用过程中发现只有四个字： 简单好用 。但是 官方 对注解的使用并没有一份完整的文档，故参考源码整理了现有的所有注解（基于版本 2.0.3 ）。 如何使用 导入依赖 第一步当然是导入依赖啦，可通过 implementation 'com.mobsandgeeks:android-saripaar:(latest version)' 导入 saripaar ，将 (latest version) 替换为最新版本即可。 使用注解 对需要进行验证的 可输入View 加上注解来标注验证规则，例 @Length(min = 6, max = 9) private AppCompatEditText et1; 该注解表示 et1 中的输入内容长度只能在6到9的闭区间。 实例化 Validator mValidator = new Validator(this); mValidator.setValidationListener(this); Validator