1 _____________________________________________________________________________
4 - evil problems with: (x y? z /ws)
5 - it gets even more evil than that
10 ______________________________________________________________________________
13 - MUST HAVE BETTER ERROR MESSAGES
14 - use for developing java15.g
16 - topology no longer needed as an arg to parser?
18 - broader regression testing (for stuff like error messages, etc)
20 - More topology untangling [later]
21 - tib: use the lexer only for indentation increases/decreases
22 - grammar highlighting?
24 - Forest needs a "manual access" API
25 - the unwrap bit in Forest makes it really hard to expose an API for forests
29 ______________________________________________________________________________
32 - finalize metagrammar and rdp-op's
37 - RFC2822 (email message/headers)
38 - clean up the whole Walk situation (?)
41 ______________________________________________________________________________
44 - serialization of parse tables
46 - "ambiguity modulo dropped fragments"?
47 - can this be checked statically?
48 - eliminated statically?
50 - substring parsing for better error messages
53 - "Regular Right Part" grammars (NP Chapman, etc)
54 - Attribute unification
56 - inference of rejections for literals
57 - "prefer whitespace higher up" (?)
59 - Labeled edges on trees (associate a label with each slot in the
60 child array in Forest.Body? might make equality tough) --
61 equivalent to Feature Structures. Colon-labeling.
63 ______________________________________________________________________________
66 - Partly-Linear-PATR? (O(n^6) unification grammar)
68 - Implement a k-token peek buffer (for each state, see if it "dead
69 ends" during the next k Phases based solely on state -- ignoring
72 - Arrange for the SPPF corresponding to dropped subtrees to never be
73 generated (or merged, etc)
75 - Is there any way we can avoid creating a GSS.Node instance for
76 nodes which are transient in the sense that they have only one
79 - Re-read Rekers, particularly the stuff on optimal sharing
81 - Isolate the Element objects from Parse.Table/GSS so we can move
84 - consider allowing a Forest.Body to represent some other Tree whose
85 Body's should be [recursively] considered part of this Forest.
87 - perhaps not: right now we have a nice situation where
88 Forest.Ref instances become immutable once iterator()ed. This
89 also gives us a strong place to to culling with the certainty
90 that we won't throw out a Body which would later be salvaged
91 by some yet-to-be-added dependency.
93 - Figure out if there is a way to:
95 - allow unwrapping of children other than the very last one.
97 - fold repetitions into an array form in Forest, before
98 conversion to Tree. The major problem here is that multiple
99 tree-arrays are possible, all of different lengths. Worse,
100 even if they're all the same length, not all elements belong
101 in the same "possibility vector" as all others. You
102 essentially need a GSS to represent the array, which perhaps
103 is what the unfolded form was in the first place.
105 - Wikipedia grammar (needs to be both lexerless and boolean)
108 => Ordered Choice (";" operator)
110 - bring back in parse-table phase resolution of precedence (just
111 like associativity). This can be inferred from the use of ">"
112 when the rules are in one of these special forms:
123 where "_" is anything and "E" is the defining nonterminal.
124 Essentially what we're looking for is the situation where the
125 leftmost portion of one rule produces another rule, and the
126 rightmost portion of the latter produces the former.
128 I'm not 100% certain that this is as "strong" as the prefer/avoid
129 form (try to prove this, you probably can), but it's "what people
130 intend" most of the time.
132 - implement Johnstone's algorithm for "reduced, resolved LR
133 tables" to eliminate superfluous reductions on
136 ______________________________________________________________________________
139 - Rekers & Koorn note that GLR Substring Parsing can be used to do
140 really elegant and generalized "autocompletion".
143 ______________________________________________________________________________
146 - Incremental parse table construction
147 - "lazy GLR" and "lazy trees" -> language with first-class CF matching
148 - perhaps linear boolean grammars instead? (linear time, quad space)
149 - Forest parsing => chained parsers
150 - unification parsing, attributes, etc
152 - Take another stab at maximal-match? Nonterminal not-followed-by is
154 - Error recovery based on substring parsing