_____________________________________________________________________________
Immediately
- - Performance
-
- - Next target: TopologicalBag (make it wickedfast: preoptimize)
-
- - Forest: keep() and valid() -- can we do this with states
- rather than subtrees?
-
- - hash Long->long: it's all bogus
-
- * huge performance improvement (try for more)
- * pick back up cleaning up end of Parser.java (Reduction)
- * some weird edge cases; check last regression test, 'make doc'
+ - Repeat, Sequence, Tree
+ - simplify Forest (considerably)
+ - decent/better error messages
+ - fix the location stuff, it's broken
- - Sensible tree-printout
- - make Tib.Block extend Tree<>
+ - copyright notices
+ - documentation
- - more natural phrasing of metagrammar?
+______________________________________________________________________________
+v1.1
- finalize metagrammar and rdp-op's
-
- - Deal with the problem of zero-rep productions and whitespace insertion
-
- - should Union.add() be there?
- - should Atom.top() be there?
-
- - fix the location stuff, it's broken
- - decent/better error messages
- - substring parsing required
-
- write some grammars
- Java grammar
- TeX (math?)
- URL (RFC)
- RFC2822 (email message/headers)
+ - clean up the whole Walk situation (?)
- - PL-PATR?
______________________________________________________________________________
Soon
- - clean up the whole Walk situation
+ - serialization of parse tables
+ - "ambiguity modulo dropped fragments"?
+ - can this be checked statically?
+ - eliminated statically?
+
+ - substring parsing for better error messages
- "lift" cases:
- right now I can only lift the last child in a forest... begs
the question of what the right representation for Forests is
- "Regular Right Part" grammars (NP Chapman, etc)
- Attribute unification
- - serialization of parse tables
- inference of rejections for literals
- "prefer whitespace higher up" (?)
- - "ambiguity modulo dropped fragments"?
- - can this be checked statically?
- - eliminated statically?
+
______________________________________________________________________________
Later
+ - Partly-Linear-PATR? (O(n^6) unification grammar)
+
- Implement a k-token peek buffer (for each state, see if it "dead
ends" during the next k Phases based solely on state -- ignoring
result SPPF)
- Rekers & Koorn note that GLR Substring Parsing can be used to do
really elegant and generalized "autocompletion".
+
+
+______________________________________________________________________________
+Ideas for the Future
+
+- Incremental parse table construction
+- "lazy GLR" and "lazy trees" -> language with first-class CF matching
+ - perhaps linear boolean grammars instead? (linear time, quad space)
+- Forest parsing => chained parsers
+- unification parsing, attributes, etc
+- RRP grammars?
+- Take another stab at maximal-match? Nonterminal not-followed-by is
+ too strong.
+- Error recovery based on substring parsing