-
This is a great collection of resources!
I think one link to add would be to the "nanopass framework" for writing compilers in Scheme/Racket. It encapsulates various recursion schemes in a little …
-
Syntax objects in Racket have lots of lovely properties, it would be nice at some point for nanopass to be able to parse syntax objects.
Another goal that seems like a nice thing to have would be t…
-
I ran into this error:
../../nanopass-framework-racket/private/pass.rkt:1188:42: tspec-pred: contract violation
expected: tspec?
given: #f
in: the 1st argument of
(-> tspec? (or/c #f iden…
-
@LeifAndersen reported that a nanopass language with a simple list of expressions does not handle creating a list with no elements in it, even though this should be handled without a problem.
@Leif…
akeep updated
5 years ago
-
Here are some recommendations from @weinholt:
* `(chibi match)` - excellent pattern matching syntax. There are a few R6RS-adaptions here and there, but the original from foof is in Snow and Akku.
…
-
Hi @akeep
I've been intensely engaged in understanding and exploring the nanopass framework and I am curious whether this can be used for non-Lispy languages as well. I do sense that it's, of cours…
-
Platform: win10 1903, chez scheme installed from [chocoloty](https://chocolatey.org/)
How to reproduce:
1. clone nanopass from github
2. scheme test-all.ss
What you expect to see:
all…
-
I'm trying to find an embeddable scheme that can parse Julia and is compatible with [the nanopass compiler framework](https://github.com/nanopass/nanopass-framework-scheme). Upscheme looks very promis…
-
This may or may not be a bug in `nanopass-case`.
If there were a nanopass-mailing list I would tried there before filing an issue.
This works:
```
(let ([M (parse '((λ (x) x) 4))])
(nanopass-c…
-
We were playing around with a tree example, where we stuck in extra non-terminals for the heck of it:
```
(define-language LTree2
(entry Tree)
(Tree (t) n l)
(Node (n) (node t0 t1))
(Leaf (l)…
akeep updated
7 years ago