Lines Matching refs:Be
17 3. The name of the author may not be used to endorse or promote products
21 shall be under the terms and conditions of this license, without any
27 IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
71 /// This is the most common create call. Override if you want another kind of node to be built.
76 /// <remarks> Override if you want another kind of node to be built.</remarks>
97 /// be packaged up in the error node. The exception could be useful
154 /// simple node or nil root with a single child node--it must be a root
157 /// Be advised that it's ok for newRoot to point at oldRoot's
290 /// <summary>Set ith child (0..n-1) to t; t must be non-null and non-nil node</summary>
321 /// be a list. Number of children may be different after this call.
324 /// If parent is null, don't do anything; must be at root of overall tree.
376 /// be a list. Number of children may be different after this call.
380 /// to know you are monkeying with the underlying tree. Also, it might be
383 /// If parent is null, don't do anything; must be at root of overall tree.
401 /// (may be null)
422 /// navigation nodes. Default should be false;
431 /// you'll be able to use more support code.
470 /// <summary>Set ith child (0..n-1) to t; t must be non-null and non-nil node</summary>
479 /// children to set their childindex; could be slow.
688 /// A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
791 /// A generic list of elements tracked in an alternative to be used in
854 /// This is used instead of next() when the result has to be a
860 /// we can't be adding trees as root; e.g., expr expr.
947 /// For now, use recursion but later nonrecursive version may be
1054 /// when you are parsing trees. To be generic the tree node types
1055 /// have to be Object :(
1065 /// No new nodes should be created in tree during the walk. A small buffer
1069 /// For tree rewriting during tree parsing, this must also be able
1180 /// be copied as the children are not considered part of this node.
1201 /// FParent should be of type ICommonTree, but that would introduce a
1507 /// Once a node or subtree has been used in a stream, it must be dup'd
1509 /// can be reused in future subrules. So, reset must set a dirty bit.
1544 /// Ensure stream emits trees; tokens must be converted to AST nodes.
1545 /// AST nodes can be passed through unmolested.
1578 /// <param name="o">The to be processed object</param>
1591 /// Tests, if the to be returned object requires duplication
1600 /// unless the element is for a tree root; then it must be a node dup
1978 /// IntStream.next is hence 1 + this value. Size will be same.
1994 /// end of the lookahead buffer so tail could be less than head.
1999 /// Calls to Mark() may be nested so we have to track a stack of them.
2081 /// this method, LT(1) will be lookahead[0].
2621 // in follow set). So, stop will be 1 to left to start. adjust.
3758 // could be an UP/DOWN node
