From 5252cc15c0d998517bf566229cd0c9d04dcff348 Mon Sep 17 00:00:00 2001 From: adam Date: Sun, 25 Dec 2005 05:27:23 -0500 Subject: [PATCH] TODO darcs-hash:20051225102723-5007d-f56d1547f13e304fb80b5d1d378c8d25d6fd3131.gz --- TODO | 21 +++------------------ 1 file changed, 3 insertions(+), 18 deletions(-) diff --git a/TODO b/TODO index f3b5856..5f5e1cf 100644 --- a/TODO +++ b/TODO @@ -3,43 +3,33 @@ Immediately - Sensible tree-printout - make Tib.Block extend Tree<> - - refine TIB - - documentation markup - more natural phrasing of metagrammar? - finalize metagrammar and rdp-op's - - Lay down the law on the different kinds of Sequence productions - and how they work. - - => mydrop - => mylift - - 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 @@ -70,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 -- 1.7.10.4