_____________________________________________________________________________
Immediately
- - Performance
+ - comparison test is probably chewing up most of the time
- - Forest: keep() and valid() -- can we do this with states
- rather than subtrees?
+ - Check if the only remaining stack is lame (hopeful/nothopeful)
+ - write a testcase for this
+ - circular gramars
+ s = A
+ A = A | "b"
+ - foo.add(x)
+ foo.add(y.andnot(x)) ==> this is broken
+ - Annotation Tutorial
- - hash Long->long: it's all bogus
+ ..................................................
- * pick back up cleaning up end of Parser.java (Reduction)
- * some weird edge cases; check last regression test, 'make doc'
+ - serializable parse tables?
+ - Treewalker code compiler?
+______________________________________________________________________________
+v1.1
- - Sensible tree-printout
- - make Tib.Block extend Tree<>
-
- - more natural phrasing of metagrammar?
-
- - finalize metagrammar and rdp-op's
+ - precedes restrictions ("<-")
+ - MUST HAVE BETTER ERROR MESSAGES
+ - use for developing java15.g
+ - java15.g
+ - once this is ready, do big announcement
+ - broader regression testing (for stuff like error messages, etc)
+ - More topology untangling [later]
+ - grammar highlighting?
+ - Forest needs a "manual access" API
+ - the unwrap bit in Forest makes it really hard to expose an API for forests
- - 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
- - substring parsing required
+______________________________________________________________________________
+v1.2
+ - finalize metagrammar and rdp-op's
- write some grammars
- Java grammar
- TeX (math?)
- URL (RFC)
- RFC2822 (email message/headers)
+ - clean up the whole Walk situation (?)
- - PL-PATR?
______________________________________________________________________________
Soon
- - clean up the whole Walk situation
+ - serialization of parse tables
+
+ - "ambiguity modulo dropped fragments"?
+ - can this be checked statically?
+ - eliminated statically?
- - "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
- if we need to be able to do lift operations on it.
+ - substring parsing for better error messages
- Parameterized LR
- "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
+ - understand and implement the RNGLR "kernel state" optimization.
+ The _Practical Early Parsing_ paper may help.
+
+ - 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)
- 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