_____________________________________________________________________________
Immediately
- - finalize metagrammar and rdp-op's
+ - Performance
- - Lay down the law on the different kinds of Sequence productions
- and how they work.
+ - Next target: TopologicalBag (make it wickedfast: preoptimize)
- => mydrop
- => mylift
+ - Forest: keep() and valid() -- can we do this with states
+ rather than subtrees?
- - whitespace-in-braces?
- - Deal with the problem of zero-rep productions and whitespace insertion
+ - 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'
+
+
+ - Sensible tree-printout
+ - make Tib.Block extend Tree<>
+
+ - more natural phrasing of metagrammar?
- - switch maximal to not-followed-by (~/~)
+ - 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)
- - Wiki grammar
+
+ - PL-PATR?
______________________________________________________________________________
Soon
- clean up the whole Walk situation
- - cleaner solution to "maximal"?
-
- "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
nodes which are transient in the sense that they have only one
eligible reduction?
- - Implement "GLR syntactic predicates" -- the ability to do
- arbitrary lookahead (ie "followed-by" and "not-followed-by" for
- arbitrary patterns). This enables generalized longest-match and
- lets us drop the Maximal hack.
-
- Re-read Rekers, particularly the stuff on optimal sharing
- Isolate the Element objects from Parse.Table/GSS so we can move