Lines Matching refs:That
9 modification, are permitted provided that the following conditions
83 /// Return a nil node (an empty but non-null node) that can hold
96 /// <para>You must specify the input stream so that the erroneous text can
121 /// i.e., without copying the array. Just make sure that this is consistent
157 /// Be advised that it's ok for newRoot to point at oldRoot's
189 /// Use the original framework assigned hashcode that's unique
256 /// store information that can lead you to the token, you can create
257 /// a token filled with the appropriate information and pass that back.
267 /// Each rule that creates AST nodes will call this
270 /// That node would contain the start/stop indexes then.
354 /// Return null for LT(0) and any index that results in an absolute address
355 /// that is negative.
367 /// an action of course in that case.
393 /// the object that provides node objects.
429 /// such as CommonTreeNodeStream that work on these kinds of trees. You
604 /// <summary>A tree node that is wrapper for a Token object. </summary>
607 /// that computing parent and child index is very difficult and cumbersome.
632 /// A TreeAdaptor that works with any Tree implementation
637 /// This is generic in the sense that it will work with any kind of
674 /// A TreeAdaptor that works with any Tree implementation. It provides
698 /// This stream is most suitable for tree interpreters that need to
759 /// the object that provides node objects.
773 /// that is more meaningful (specific) and holds a String to display for a node.
813 /// Reset the condition of this stream so that it appears we have
926 /// patterns like "(A B C)". You can create a tree from that pattern or
933 /// Compute a Map<String, Integer> that is an inverted index of
951 /// TODO: save this index so that find and visit are faster
977 /// For all subtrees that match the pattern, execute the visit action.
995 /// If a node specifies a text arg in pattern, then that must match
996 /// for that node in t.
1005 /// Create a tree or node from the indicated tree pattern that closely
1030 /// The trees are examined in their entirety so that (A B) does not match
1035 /// TODO: have a version that is nonstatic so it can use instance adaptor
1052 /// This is identical to the ParserRuleReturnScope except that
1071 /// That part is not yet implemented. Will permit a rule to return
1201 /// FParent should be of type ICommonTree, but that would introduce a
1508 /// from then on. Streams are reset after subrules so that the streams
1516 /// rule reference that this list tracks. Can include rulename too, but
1517 /// the exception would track that info.
1533 /// Do the work of getting the next element, making sure that
2061 /// use a single return value for that. We must add these tokens to
3310 // if we have the token stream, use that to dump text in order
3723 inherited Create; // highlight that we go to super to set state object
4522 // copy 0..tail to after that
4941 // if we have the token stream, use that to dump text in order
