_____________________________________________________________________________
Immediately
- - simplify metagrammar => go to top-down rewriting => finalize metagrammar and rdp-op's
+ - Sensible tree-printout
+ - make Tib.Block extend Tree<>
- - What is our use model?
- - Parse, attribute, unify (ag)
- - Parse, transform tree, walk (rdp)
- - Parse, walk
- - cascading tree rewrites
+ - more natural phrasing of metagrammar?
- ==> use the middle formalism "for now" and in meta.g; layer others
- on top of it
+ - finalize metagrammar and rdp-op's
- - Lay down the law on the different kinds of Sequence productions
- and how they work.
-
- => mydrop
- => mylift
-
- - 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
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
- 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".