_____________________________________________________________________________
Immediately
- - Performance
+ - foo.add(x)
+ foo.add(y.andnot(x)) ==> this is broken
- - Forest: keep() and valid() -- can we do this with states
- rather than subtrees?
+ - Annotation Tutorial
- - hash Long->long: it's all bogus
+ ..................................................
- * pick back up cleaning up end of Parser.java (Reduction)
+ - evil problems with: (x y? z /ws)
+ - it gets even more evil than that
+ - basically, follow restrictions are not honored when the element
+ matches against the empty string
- - [more] sensible tree-printout
+______________________________________________________________________________
+v1.1
- - revamp Tib.Block (do it all in the parser using indent/dedent?)
+ - precedes restrictions ("<-")
- - more natural phrasing of metagrammar?
- - finalize metagrammar and rdp-op's
+ - MUST HAVE BETTER ERROR MESSAGES
+ - use for developing java15.g
+
+ - java15.g
+ - once this is ready, do big announcement
+
+ - topology no longer needed as an arg to parser?
+
+ - broader regression testing (for stuff like error messages, etc)
+
+ - More topology untangling [later]
+ - tib: use the lexer only for indentation increases/decreases
+ - grammar highlighting?
- - should Union.add() be there?
- - should Atom.top() be there?
+ - Forest needs a "manual access" API
+ - the unwrap bit in Forest makes it really hard to expose an API for forests
- - decent/better error messages
- - fix the location stuff, it's broken
+
+______________________________________________________________________________
+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 (?)
______________________________________________________________________________
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?
- - "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
- 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