Lines Matching refs:Can
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
120 /// can decide it is ok to move children to t via t.children = child.children;
181 /// For identifying trees. How to identify nodes so we can say "add node
241 /// <summary>Node constructors can set the type of a node </summary>
246 /// <summary>Node constructors can set the text of a node </summary>
256 /// store information that can lead you to the token, you can create
325 /// Can't replace whatever points to the parent externally. Do nothing.
364 /// If the stream does not buffer all the nodes then it can still
365 /// walk recursively from start until stop. You can always return
384 /// Can't replace whatever points to the parent externally. Do nothing.
405 /// TokenStream, you can specify it here. Used to do rule $text
412 /// What adaptor can tell me how to interpret/navigate nodes and trees.
433 /// NOTE: When constructing trees, ANTLR can build any kind of tree; it can
477 /// a list (nil-root tree). num of children can increase or decrease.
478 /// For huge child lists, inserting children can force walking rest of
688 /// A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
860 /// we can't be adding trees as root; e.g., expr expr.
914 /// this class can build the map). I.e., Token DECL means nothing unless the
915 /// class can translate it to a token type.
920 /// This class can build a token type -> node index for repeated use or for
926 /// patterns like "(A B C)". You can create a tree from that pattern or
1012 /// You can also just pass in a node: ID
1014 /// Any node can have a text argument: ID[foo]
1035 /// TODO: have a version that is nonstatic so it can use instance adaptor
1358 /// the buffer so we can set token types of interest for reverseIndexing.
1509 /// can be reused in future subrules. So, reset must set a dirty bit.
1516 /// rule reference that this list tracks. Can include rulename too, but
1545 /// AST nodes can be passed through unmolested.
2060 /// we can Emit many tokens for every MoveNext() call, it's pretty hard to
2338 // fill in as many children as we can (replacingHowMany) w/o moving data
3622 // out of elements and size was not 1, so we can't dup
4783 raise EInvalidOperation.Create('can''t do stream rewrites yet');
4828 raise EArgumentOutOfRangeException.Create('can''t seek backwards in node stream');
