X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=fb89b5213e015b7fc5f814f9f3f413a2d26e8634;hp=493145738ef91c6d56618ee8c84216e2b3f14efd;hb=e5d6a50df43fa50f217b30b0959a1d39f65b621c;hpb=0a0227b9180534d2a431f3d6e08a398bde2244c4 diff --git a/TODO b/TODO index 4931457..fb89b52 100644 --- a/TODO +++ b/TODO @@ -1,40 +1,50 @@ +_____________________________________________________________________________ +Immediately -______________________________________________________________________________ -pre-1.0 - - - Javadoc comments + - clean up the whole Walk situation (?) - - switch maximal to not-followed-by (~/~) + - decent/better error messages + - fix the location stuff, it's broken - - should Union.add() be there? - - should Atom.top() be there? - - fix the location stuff, it's broken - - decent/better error messages +______________________________________________________________________________ +v1.1 - - finalize metagrammar + - finalize metagrammar and rdp-op's + - write some grammars - Java grammar - TeX (math?) - URL (RFC) - RFC2822 (email message/headers) - - WIKI!!! TEX!!! ______________________________________________________________________________ -Undecided +Soon + + - serialization of parse tables - - public API for hates/needs + - "ambiguity modulo dropped fragments"? + - can this be checked statically? + - eliminated statically? - - clean up the whole Walk situation - - cleaner solution to "maximal"? + - 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 if we need to be able to do lift operations on it. + - Parameterized LR + - "Regular Right Part" grammars (NP Chapman, etc) + - Attribute unification + + - inference of rejections for literals + - "prefer whitespace higher up" (?) + ______________________________________________________________________________ -post-1.0 +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 @@ -47,11 +57,6 @@ post-1.0 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 @@ -108,3 +113,23 @@ post-1.0 - implement Johnstone's algorithm for "reduced, resolved LR tables" to eliminate superfluous reductions on epsilon-transitions. + +______________________________________________________________________________ +Neat Ideas + + - 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