projects
/
sbp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
checkpoint
[sbp.git]
/
TODO
diff --git
a/TODO
b/TODO
index
c7ad150
..
2cec777
100644
(file)
--- a/
TODO
+++ b/
TODO
@@
-1,42
+1,42
@@
_____________________________________________________________________________
Immediately
_____________________________________________________________________________
Immediately
- - Performance
+- Migrate Demo.java -> MetaGrammar.java
+ - Figure out serialization
- - Forest: keep() and valid() -- can we do this with states
- rather than subtrees?
+- Clean up the prioritized-match garbage
+ - evil problems with (x y? z /ws)
- - hash Long->long: it's all bogus
- * pick back up cleaning up end of Parser.java (Reduction)
+ - better ambiguity debugging tools / visualization
+ - ParseFailed, GSS, Walk, Parser, Sequence, Forest
+ - copyright notices
+ - documentation
- - [more] sensible tree-printout
-
- - revamp Tib.Block (do it all in the parser using indent/dedent?)
+______________________________________________________________________________
+v1.1
- - more natural phrasing of metagrammar?
- finalize metagrammar and rdp-op's
- finalize metagrammar and rdp-op's
-
- - should Union.add() be there?
- - should Atom.top() be there?
-
- - decent/better error messages
- - fix the location stuff, it's broken
-
- write some grammars
- Java grammar
- TeX (math?)
- URL (RFC)
- RFC2822 (email message/headers)
- write some grammars
- Java grammar
- TeX (math?)
- URL (RFC)
- RFC2822 (email message/headers)
+ - clean up the whole Walk situation (?)
+
+ - what if Tree<> could unwrap itself?
______________________________________________________________________________
Soon
______________________________________________________________________________
Soon
- - substring parsing for better error messages
+ - serialization of parse tables
- - clean up the whole Walk situation
+ - "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
- "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
@@
-46,12
+46,12
@@
Soon
- "Regular Right Part" grammars (NP Chapman, etc)
- Attribute unification
- "Regular Right Part" grammars (NP Chapman, etc)
- Attribute unification
- - serialization of parse tables
- inference of rejections for literals
- "prefer whitespace higher up" (?)
- inference of rejections for literals
- "prefer whitespace higher up" (?)
- - "ambiguity modulo dropped fragments"?
- - can this be checked statically?
- - eliminated statically?
+
+ - Labeled edges on trees (associate a label with each slot in the
+ child array in Forest.Body? might make equality tough) --
+ equivalent to Feature Structures. Colon-labeling.
______________________________________________________________________________
Later
______________________________________________________________________________
Later