Lines Matching refs:Parser
280 /// Errors from the lexer are never passed to the parser. Either you want
285 /// lexing then you should not throw an exception to the parser--it has already
300 /// to the parser.
486 /// parser is protected.
686 /// lexer, parser, and tree grammars. This is all the parsing
705 /// <summary>Reset the parser's state. Subclasses must rewind the input stream.</summary>
740 /// This method sets errorRecovery to indicate the parser is recovering
742 /// To get out of recovery mode, the parser must successfully Match
823 /// Returns List <String> of the rules in your parser instance
826 /// in the parser source code a rule is invoked.
906 /// Get number of recognition errors (lexer, parser, tree parser). Each
907 /// recognizer tracks its own number. So parser and lexer each have
939 /// and tokens are prefiltered for a certain channel (the parser will only
1090 /// Parser or TreeParser.GetMissingSymbol().</para>
1138 /// <summary>A parser for TokenStreams. Parser grammars result in a subclass
1153 /// <summary>Set the token stream and reset the parser </summary>
1239 /// Parser: IParser;
1243 /// Parser := TParser.Create(tokens);
1244 /// Parser.startRule();
1355 /// the various reporting methods in Parser and Lexer can be overridden
1371 /// problem occurred and/or what was the expected input. While the parser
1376 /// Better to just say the recognizer had a problem and then let the parser
1397 /// <summary>[Tree parser] Node with the problem.</summary>
1429 /// although a tree parser might also set the token)
1434 /// Returns the [tree parser] node where the error occured (for tree parsers).
1942 /// All tokens go to the parser (unless skip() is called in that rule)
1943 /// on a particular "channel". The parser tunes to a particular channel
1944 /// so that whitespace etc... can go to the parser on a "hidden" channel.
1949 /// Anything on different channel than DEFAULT_CHANNEL is not parsed by parser.
1992 /// this lexer, parser or tree parser.
1995 /// The state of a lexer, parser, or tree parser are collected into
2042 /// ')'. When the parser returns from the nested call to expr, it
2076 /// action in the parser or tree parser works. It simply creates
2146 * rule invocation, the parser pushes the set of tokens that can
2213 * So, you cna see that the parser walks up call chain looking
5634 inherited Create(AState); // share the state object with another parser
