Ben Lynn
This sounds familiar. I recall enjoying the challenge of tracking the states of each DFA. I wonder if the slowness is caused by leaking goroutines rather than the overhead of...
I had a brief look, and it seems all goroutines return so long as end of input is reached. They send one last frame with i = -1 down the...
I've been wanting to add modules for a while. I've been holding off because I wanted to explore a little, and try implementing Agda-style modules for example. But perhaps it's...
On closer inspection, it looks like "crossly" was my first compiler to support `#include`. It's just undocumented. So if you manage to get "crossly" working, you can temporarily use includes...
I added modules, though there are many caveats at present. It's based on "methodically", and I hope to work my way back up to "crossly" via modules. https://crypto.stanford.edu/~blynn/compiler/module.html
I hope to get around to it some time.
I have a rough implementation of qualified imports and hiding, though modules in general are rough around the edges.
A related issue: trying to parse a Double >= 2^32 seems to wrap around, e.g. "9999999999" (ten 9s) gives 1410065407.0, which is (10^10 - 1) mod 2^32. import Haste main...