1 _____________________________________________________________________________
4 * we can nuke Atom.toAtom() now!
5 - Topology crap is kinda messed up
7 - do Forest/Tree still need a Region?
8 - reconsider the degree of genericization
9 - GraphViz stuff pollutes the API...
10 - Forest needs a "manual access" API
11 - the unwrap bit in Forest makes it really hard to expose an API for forests
13 - evil problems with (x y? z /ws)
14 - ParseFailed, GSS, Walk, Parser, Sequence, Forest
18 - grammar highlighting?
19 - comment indentation vs block indentation?
21 - recursive { { foo } }
23 ______________________________________________________________________________
26 - finalize metagrammar and rdp-op's
31 - RFC2822 (email message/headers)
32 - clean up the whole Walk situation (?)
35 ______________________________________________________________________________
38 - serialization of parse tables
40 - "ambiguity modulo dropped fragments"?
41 - can this be checked statically?
42 - eliminated statically?
44 - substring parsing for better error messages
47 - "Regular Right Part" grammars (NP Chapman, etc)
48 - Attribute unification
50 - inference of rejections for literals
51 - "prefer whitespace higher up" (?)
53 - Labeled edges on trees (associate a label with each slot in the
54 child array in Forest.Body? might make equality tough) --
55 equivalent to Feature Structures. Colon-labeling.
57 ______________________________________________________________________________
60 - Partly-Linear-PATR? (O(n^6) unification grammar)
62 - Implement a k-token peek buffer (for each state, see if it "dead
63 ends" during the next k Phases based solely on state -- ignoring
66 - Arrange for the SPPF corresponding to dropped subtrees to never be
67 generated (or merged, etc)
69 - Is there any way we can avoid creating a GSS.Node instance for
70 nodes which are transient in the sense that they have only one
73 - Re-read Rekers, particularly the stuff on optimal sharing
75 - Isolate the Element objects from Parse.Table/GSS so we can move
78 - consider allowing a Forest.Body to represent some other Tree whose
79 Body's should be [recursively] considered part of this Forest.
81 - perhaps not: right now we have a nice situation where
82 Forest.Ref instances become immutable once iterator()ed. This
83 also gives us a strong place to to culling with the certainty
84 that we won't throw out a Body which would later be salvaged
85 by some yet-to-be-added dependency.
87 - Figure out if there is a way to:
89 - allow unwrapping of children other than the very last one.
91 - fold repetitions into an array form in Forest, before
92 conversion to Tree. The major problem here is that multiple
93 tree-arrays are possible, all of different lengths. Worse,
94 even if they're all the same length, not all elements belong
95 in the same "possibility vector" as all others. You
96 essentially need a GSS to represent the array, which perhaps
97 is what the unfolded form was in the first place.
99 - Wikipedia grammar (needs to be both lexerless and boolean)
102 => Ordered Choice (";" operator)
104 - bring back in parse-table phase resolution of precedence (just
105 like associativity). This can be inferred from the use of ">"
106 when the rules are in one of these special forms:
117 where "_" is anything and "E" is the defining nonterminal.
118 Essentially what we're looking for is the situation where the
119 leftmost portion of one rule produces another rule, and the
120 rightmost portion of the latter produces the former.
122 I'm not 100% certain that this is as "strong" as the prefer/avoid
123 form (try to prove this, you probably can), but it's "what people
124 intend" most of the time.
126 - implement Johnstone's algorithm for "reduced, resolved LR
127 tables" to eliminate superfluous reductions on
130 ______________________________________________________________________________
133 - Rekers & Koorn note that GLR Substring Parsing can be used to do
134 really elegant and generalized "autocompletion".
137 ______________________________________________________________________________
140 - Incremental parse table construction
141 - "lazy GLR" and "lazy trees" -> language with first-class CF matching
142 - perhaps linear boolean grammars instead? (linear time, quad space)
143 - Forest parsing => chained parsers
144 - unification parsing, attributes, etc
146 - Take another stab at maximal-match? Nonterminal not-followed-by is
148 - Error recovery based on substring parsing