projects
/
sbp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
fixed ambiguity in comments
[sbp.git]
/
TODO
diff --git
a/TODO
b/TODO
index
972a801
..
5f5e1cf
100644
(file)
--- a/
TODO
+++ b/
TODO
@@
-1,28
+1,35
@@
-______________________________________________________________________________
+_____________________________________________________________________________
Immediately
Immediately
- - switch maximal to not-followed-by (~/~)
+ - Sensible tree-printout
+ - make Tib.Block extend Tree<>
+
+ - more natural phrasing of metagrammar?
+
+ - 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
- 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)
- write some grammars
- Java grammar
- TeX (math?)
- URL (RFC)
- RFC2822 (email message/headers)
- - Wiki grammar
+
+ - PL-PATR?
______________________________________________________________________________
Soon
- clean up the whole Walk situation
______________________________________________________________________________
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
- "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
@@
-53,11
+60,6
@@
Later
nodes which are transient in the sense that they have only one
eligible reduction?
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
- Re-read Rekers, particularly the stuff on optimal sharing
- Isolate the Element objects from Parse.Table/GSS so we can move
@@
-114,3
+116,9
@@
Later
- implement Johnstone's algorithm for "reduced, resolved LR
tables" to eliminate superfluous reductions on
epsilon-transitions.
- 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".