+// priorities are all messy and dont get serialized
+// 1. Error messages
+// 2. Java MetaGrammar (proof of concept)
+// 3. Ivan's MetaGrammar
+// 4. Documentation format
+// - TIB
+
+// TODO: better API for interfacing with Java
+// TODO: error messages
+// TODO: integrate with TIB
+
+// Element
+// Walk
+// ParseTable / GSS
+// MetaGrammar (necessary/relevant?)
+// Tree<String> (cleanup?)
+// Union.SubUnion
+// Repeat
+
+// FEATURE: serialization of ParseTable's, generation of Java code
+// FEATURE: infer reject elements for literals
+// FEATURE: prefer whitespace higher up
+// FEATURE: full conjunctive and boolean grammars
+// FEATURE: "ambiguity modulo dropped fragments"? can this be checked for statically? eliminated statically?
+// - drop stuff during the parsing process (drop nodes)
+
+// LATER: Element<A> -- parameterize over the input token type? Makes a huge mess...
+// LATER: Go back to where Sequence is not an Element?
+// - The original motivation for making Sequence "first class" was the fact that
+// in order to do associativity right you need to have per-Sequence follow sets
______________________________________________________________________________
-pre-1.0
-
- - Javadoc comments
+Immediately
- switch maximal to not-followed-by (~/~)
- fix the location stuff, it's broken
- decent/better error messages
- - finalize metagrammar
+ - write some grammars
- Java grammar
- TeX (math?)
- URL (RFC)
- RFC2822 (email message/headers)
-
- - WIKI!!! TEX!!!
+ - Wiki grammar
______________________________________________________________________________
-Undecided
-
- - public API for hates/needs
+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
if we need to be able to do lift operations on it.
+ - Parameterized LR
+ - "Regular Right Part" grammars (NP Chapman, etc)
+ - Attribute unification
______________________________________________________________________________
-post-1.0
+Later
- Implement a k-token peek buffer (for each state, see if it "dead
ends" during the next k Phases based solely on state -- ignoring