Switch branches/tags
Nothing to show
Find file
Fetching contributors…
Cannot retrieve contributors at this time
43 lines (35 sloc) 1.84 KB
This is a list of things I definitely want to do. I don't go into too many
specifics, because the specifics change often as I think about the problem
* What about GLAs with EOF out of the start state? If there is only one
non-EOF transition, it *seems* pointless, because our normal EOF stack
unwinding seems to cover it. On the other hand, verifying this is always
true seems like a lot of hard thought. Let's think of it as an optimization
and do it later.
Compiler / Grammar Analysis (all changes should have test-cases):
* (maybe) take regular subset of non-regular lookahead when it doesn't
cause alternatives' languages to intersect.
* (maybe) support full-LL by having first states of GLA have edges that
are the states on the return stack at runtime.
* detect cases where some RTN alternatives have no GLA final state.
(shouldn't happen, modulo bugs).
* deal with lexer-level ambiguity. longest match will do for now, but
we're not currently detecting s -> "A" | "AB";
* Richer callback specifiers.
* Bring back slotbufs: a cheap (stack only, no heap) way of saving parse_vals for
the currently-open nodes of the parse tree.
* Provide a buffering layer.
* As the runtime starts to mature: language bindings.
Tests! Everything should have tests, as much as possible:
* all aspects of compilation
* bitcode format (both reading and writing)
* JSON output from gzlparse. Both well-formedness and accuracy.
Major design areas that exist only in my head:
* Character sets other than ASCII.
* Embedding Lua to do things only an imperative language can do.
* Operator-precedence parsing using the shunting yard algorithm.
* Parallel parsers (for both embedded languages and things like whitespace/comments)
* Error recovery (basically: just yield to an imperative function).
* Generate imperative bytecode / JIT compile.
* AST-building.