1.5 KiB
1.5 KiB
TODO
Handling ambiguity (GLR)
- Add a simple way to specify syntactic ambiguity resolutions in the Grammar (e.g. 'prefer declarations to statements' in C)
- Optimize the lexical DFA so that all compatible starting lex states are merged. Then, when the parse stack has multiple heads, check at runtime that each head's state corresponds to the same starting lex state.
- Fix memory leaks in the graph-structured parse stack.
Runtime System
- Make separate symbol for unexpected characters than for interior error nodes.
- Make anonymous tokens visible via separate API methods
Testing / Quality
- Start running the clang-analyzer on the codebase on travis-CI.
- Use the Valgrind leak checker to fix the memory leaks in the runtime library.
- Randomize the editing in the language tests, using a seed that can be specified in order to reproduce failures.
- Verify that the tree's total size is as expected after each edit.
Ubiquitous token handling
- Fix the unintuitive tree that results when ubiquitous tokens are last child of their parent node.
Error handling
- Use information about nesting depth of tokens like '(' and ')' to make error recovery more accurate.
Grammar Features
- Regexp assertions
- '^'
- '$'
- '\b'
- Composing languages
- Rule for referencing named grammar
- Grammar registry object in runtime
- Parsing returns control to parent language
- Indentation tokens
Performance
- Optimize grammar compilation