_____________________________________________________________________________
Immediately
- - Lay down the law on the different kinds of Sequence productions
- and how they work.
+- If a top-level rule has labels but no head-tag, like this
+ Foo = a:Bar b:Baz
+ then infer the name of the rule it belongs to
- - switch maximal to not-followed-by (~/~)
+create( $c:{...}, class ) =
+ return create($c:{...})
- - should Union.add() be there?
- - should Atom.top() be there?
+create( h:{...}, class ) =
- - fix the location stuff, it's broken
- - decent/better error messages
+create( , String)
+create( _:{...}, String) = treat as char[]
+create( _:{...}, c[] ) = { create(.,c), create(.,c), ... }
+
+create( $c:{...} ) =
+
+
+ - better ambiguity debugging tools / visualization
+
+ - ParseFailed, GSS, Walk, Parser, Sequence, Forest
+
+ - Fix the metagrammar (really?)
+ - evil problems with (x y? z /ws)
+
+ - copyright notices
+ - documentation
+
+______________________________________________________________________________
+v1.1
+
+ - finalize metagrammar and rdp-op's
- write some grammars
- Java grammar
- TeX (math?)
- URL (RFC)
- RFC2822 (email message/headers)
- - Wiki grammar
+ - clean up the whole Walk situation (?)
+
+ - what if Tree<> could unwrap itself?
+
______________________________________________________________________________
Soon
- - clean up the whole Walk situation
+ - serialization of parse tables
- - cleaner solution to "maximal"?
+ - "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
- "Regular Right Part" grammars (NP Chapman, etc)
- Attribute unification
- - serialization of parse tables
- 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
+ - Partly-Linear-PATR? (O(n^6) unification grammar)
+
- Implement a k-token peek buffer (for each state, see if it "dead
ends" during the next k Phases based solely on state -- ignoring
result SPPF)
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".
+
+
+______________________________________________________________________________
+Ideas for the Future
+
+- Incremental parse table construction
+- "lazy GLR" and "lazy trees" -> language with first-class CF matching
+ - perhaps linear boolean grammars instead? (linear time, quad space)
+- Forest parsing => chained parsers
+- unification parsing, attributes, etc
+- RRP grammars?
+- Take another stab at maximal-match? Nonterminal not-followed-by is
+ too strong.
+- Error recovery based on substring parsing
projects / sbp.git / blobdiff