2013-11-14 12:55:02 -08:00
|
|
|
TODO
|
|
|
|
|
====
|
|
|
|
|
|
2014-10-08 15:16:40 -07:00
|
|
|
* Performance
|
|
|
|
|
* Implement the remainder of the incremental parsing algorithm: re-use parse tree after the edit
|
|
|
|
|
* Optimize grammar compilation
|
2014-07-13 21:52:57 -07:00
|
|
|
|
2014-10-08 15:16:40 -07:00
|
|
|
* Error handling
|
|
|
|
|
* Preserve tokens within error nodes
|
|
|
|
|
* Try to minimize size of error node by looking ahead a few tokens
|
2014-07-13 21:52:57 -07:00
|
|
|
|
2014-10-08 15:16:40 -07:00
|
|
|
* Grammar Features
|
|
|
|
|
* Indentation tokens
|
|
|
|
|
* Regexp assertions
|
|
|
|
|
- [ ] '^'
|
|
|
|
|
- [ ] '$'
|
|
|
|
|
- [ ] '\b'
|
|
|
|
|
* Composing languages
|
|
|
|
|
- [ ] Rule for referencing named grammar
|
|
|
|
|
- [ ] Grammar registry object in runtime
|
|
|
|
|
- [ ] Parsing returns control to parent language
|
2014-07-13 21:52:57 -07:00
|
|
|
|
2014-10-08 15:16:40 -07:00
|
|
|
* Grammars
|
|
|
|
|
* C
|
|
|
|
|
* Go
|
|
|
|
|
|
|
|
|
|
* Query API
|
|
|
|
|
* closest(node name)
|
|
|
|
|
* find(node name)
|
