2013-11-14 12:55:02 -08:00
|
|
|
TODO
|
|
|
|
|
====
|
|
|
|
|
|
2014-07-13 21:52:57 -07:00
|
|
|
Backlog
|
|
|
|
|
-------
|
|
|
|
|
|
2014-07-21 12:54:17 -07:00
|
|
|
* Handle UTF8 strings
|
2014-09-09 12:31:47 -07:00
|
|
|
* Implement assertions in regexps ('^', '$', etc)
|
2014-07-13 21:52:57 -07:00
|
|
|
* Make parse error handling more robust
|
2014-09-09 12:31:47 -07:00
|
|
|
* Create C and go grammars
|
|
|
|
|
* Implement the remainder of the incremental parsing algorithm: reuse parse tree after the edit
|
|
|
|
|
* Expand the AST Node querying API (`closest(node_name)`, `find(node_name)`, etc)
|
2014-04-28 09:03:29 -07:00
|
|
|
* Add special lexical behavior for indentation-aware languages
|
2014-07-13 21:52:57 -07:00
|
|
|
* Speed up grammar compilation
|
|
|
|
|
|
|
|
|
|
Icebox
|
|
|
|
|
------
|
|
|
|
|
|
2014-04-28 09:03:29 -07:00
|
|
|
* Implement Pager's [Practical general method](http://link.springer.com/article/10.1007%2FBF00290336)
|
2014-03-29 19:14:42 -07:00
|
|
|
for reducing the size of the LR(1) parse table
|