1 _____________________________________________________________________________
6 - Forest: keep() and valid() -- can we do this with states
9 - hash Long->long: it's all bogus
11 * pick back up cleaning up end of Parser.java (Reduction)
12 * some weird edge cases; check last regression test, 'make doc'
15 - Sensible tree-printout
16 - make Tib.Block extend Tree<>
18 - more natural phrasing of metagrammar?
20 - finalize metagrammar and rdp-op's
22 - Deal with the problem of zero-rep productions and whitespace insertion
24 - should Union.add() be there?
25 - should Atom.top() be there?
27 - fix the location stuff, it's broken
28 - decent/better error messages
29 - substring parsing required
35 - RFC2822 (email message/headers)
39 ______________________________________________________________________________
42 - clean up the whole Walk situation
45 - right now I can only lift the last child in a forest... begs
46 the question of what the right representation for Forests is
47 if we need to be able to do lift operations on it.
50 - "Regular Right Part" grammars (NP Chapman, etc)
51 - Attribute unification
53 - serialization of parse tables
54 - inference of rejections for literals
55 - "prefer whitespace higher up" (?)
56 - "ambiguity modulo dropped fragments"?
57 - can this be checked statically?
58 - eliminated statically?
60 ______________________________________________________________________________
63 - Implement a k-token peek buffer (for each state, see if it "dead
64 ends" during the next k Phases based solely on state -- ignoring
67 - Arrange for the SPPF corresponding to dropped subtrees to never be
68 generated (or merged, etc)
70 - Is there any way we can avoid creating a GSS.Node instance for
71 nodes which are transient in the sense that they have only one
74 - Re-read Rekers, particularly the stuff on optimal sharing
76 - Isolate the Element objects from Parse.Table/GSS so we can move
79 - consider allowing a Forest.Body to represent some other Tree whose
80 Body's should be [recursively] considered part of this Forest.
82 - perhaps not: right now we have a nice situation where
83 Forest.Ref instances become immutable once iterator()ed. This
84 also gives us a strong place to to culling with the certainty
85 that we won't throw out a Body which would later be salvaged
86 by some yet-to-be-added dependency.
88 - Figure out if there is a way to:
90 - allow unwrapping of children other than the very last one.
92 - fold repetitions into an array form in Forest, before
93 conversion to Tree. The major problem here is that multiple
94 tree-arrays are possible, all of different lengths. Worse,
95 even if they're all the same length, not all elements belong
96 in the same "possibility vector" as all others. You
97 essentially need a GSS to represent the array, which perhaps
98 is what the unfolded form was in the first place.
100 - Wikipedia grammar (needs to be both lexerless and boolean)
103 => Ordered Choice (";" operator)
105 - bring back in parse-table phase resolution of precedence (just
106 like associativity). This can be inferred from the use of ">"
107 when the rules are in one of these special forms:
118 where "_" is anything and "E" is the defining nonterminal.
119 Essentially what we're looking for is the situation where the
120 leftmost portion of one rule produces another rule, and the
121 rightmost portion of the latter produces the former.
123 I'm not 100% certain that this is as "strong" as the prefer/avoid
124 form (try to prove this, you probably can), but it's "what people
125 intend" most of the time.
127 - implement Johnstone's algorithm for "reduced, resolved LR
128 tables" to eliminate superfluous reductions on
131 ______________________________________________________________________________
134 - Rekers & Koorn note that GLR Substring Parsing can be used to do
135 really elegant and generalized "autocompletion".