Lines Matching refs:So
57 /// I do not need to know the type of a tree at all so they are all
96 /// <para>You must specify the input stream so that the erroneous text can
159 /// constructing these nodes so we should have this control for
181 /// For identifying trees. How to identify nodes so we can say "add node
351 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
420 /// so we have to instantiate new ones. When doing normal tree
576 /// directly is not a supported operation (i.e. you do so at your own risk)
813 /// Reset the condition of this stream so that it appears we have
871 /// ITreeAdaptor.Create() returns an object, so no further restrictions possible.
913 /// of tokens so you have to pass in a map or array of token names (from which
951 /// TODO: save this index so that find and visit are faster
981 /// with visit(t, ttype, visitor) so nil-rooted patterns are not allowed.
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
1358 /// the buffer so we can set token types of interest for reverseIndexing.
1441 /// so instantiate new ones when uniqueNavigationNodes is true.
1508 /// from then on. Streams are reset after subrules so that the streams
1509 /// can be reused in future subrules. So, reset must set a dirty bit.
1952 /// As we walk down the nodes, we must track parent nodes so we know
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.
2099 /// so instantiate new ones when uniqueNavigationNodes is true.
2621 // in follow set). So, stop will be 1 to left to start. adjust.
3622 // out of elements and size was not 1, so we can't dup
4742 // so don't throw NoSuchElementException
