Lines Matching refs:So
83 /// The Lexer tracks line/col info as well as input index so its markers are
100 /// Resets the stream so that the next call to
136 /// argument. So if you're nested 5 levels of Mark(), and then Release(2)
156 /// mechanism that restores state and so this method does not need to
163 /// the ith symbol. So, seeking to 0 means LA(1) will return the first
325 /// I < 0 indicates tokens in the past. So -1 is previous token and -2 is
366 /// etc...) so that we can rewind the state after scanning ahead.
398 so that it is in the same state it was
595 /// something nonnull so that the auto token emit mechanism will not
743 /// a token (after a resync). So it will go:
768 /// routines and so on. Also, changing the message for an exception type would be
795 /// so that it creates a new type.
907 /// recognizer tracks its own number. So parser and lexer each have
955 /// when interpreting, we cannot exec actions so we need to tell
1101 /// a token, so do the easy thing and just kill a character and hope
1127 /// The getter returns the text matched so far for the current token or any
1199 /// could add a ctor to this so that we can pass in and store the input
1221 /// current index. If so, the operation is done and then normal String
1275 /// <summary>Rollback the instruction stream for a program so that
1284 /// <summary>Reset the program so that no instructions exist </summary>
1358 /// So, don't expect getMessage() to return anything.
1373 /// state can change before the exception is reported so current token index
1944 /// so that whitespace etc... can go to the parser on a "hidden" channel.
1996 /// external state objects so that the state can be shared. This sharing
2017 /// Factor out what to do upon token mismatch so tree parsers can behave
2203 * In this case, for input "[]", LA(1) is in this set so we would
2213 * So, you cna see that the parser walks up call chain looking
2300 /// <summary>Record every single token pulled from the source so we can reproduce
4571 // BitSet cannot handle negative numbers like -1 (EOF) so I leave EOR
4611 // where LT(1) is in the recovery token set so nothing is
4612 // consumed; consume a single token so at least to prevent
4651 ReportError(E); // report after consuming so AW sees the token in the exception
4664 ReportError(E); // report after inserting so AW sees the token in the exception
6073 // whole token buffer so no lazy eval issue with any templates
6236 IndexToOp.Remove(I); // remove so any left have index size-1
6249 // So, if they did an insertAfter(lastValidIndex, "foo"), include
