X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=5f5e1cf6546399a5c3e34f45890b9f2bae1024a4;hp=27e96945a8f0d0ac0b45867a000d09e952215d35;hb=7d87b6f9aa045ec7e4a802a88240a235c5fde5a3;hpb=f7dc68eeb40878c12463fc1ed2b4351b2a9fe261 diff --git a/TODO b/TODO index 27e9694..5f5e1cf 100644 --- a/TODO +++ b/TODO @@ -1,39 +1,35 @@ _____________________________________________________________________________ Immediately - - finalize metagrammar and rdp-op's + - Sensible tree-printout + - make Tib.Block extend Tree<> - - Lay down the law on the different kinds of Sequence productions - and how they work. + - more natural phrasing of metagrammar? - => mydrop - => mylift + - finalize metagrammar and rdp-op's - - whitespace-in-braces? - Deal with the problem of zero-rep productions and whitespace insertion - - switch maximal to not-followed-by (~/~) - - 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 @@ -64,11 +60,6 @@ Later 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