| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3inputstream.c | 477 * elements of the lexer state.
490 /** \brief Rewind the lexer input to the state specified by the last produced mark.
503 /** \brief Rewind the lexer input to the state specified by the supplied mark.
542 /** \brief Rewind the lexer input to the state specified by the supplied mark.
562 /** \brief Rewind the lexer input to the state specified by the supplied mark.
706 // of lexer->parser->tree->treeparser and so on.
[all...] |
| /external/llvm/docs/tutorial/ |
| LangImpl5.rst | 26 lexer, parser, AST, and LLVM code emitter. This example is nice, because
60 Lexer Extensions for If/Then/Else
63 The lexer extensions are straightforward. First we add new enum values
71 Once we have that, we recognize the new keywords in the lexer. This is
105 Now that we have the relevant tokens coming from the lexer and we have
434 Lexer Extensions for the 'for' Loop
437 The lexer extensions are the same sort of thing as for if/then/else:
766 // Lexer
769 // The lexer returns tokens [0-255] if it is an unknown character, otherwise one
[all...] |
| OCamlLangImpl4.rst | 437 <{lexer,parser}.ml>: use_camlp4, pp(camlp4of)
460 * Lexer Tokens
463 (* The lexer returns these 'Kwd' if it is an unknown character, otherwise one of
475 lexer.ml:
479 * Lexer
[all...] |
| /external/webkit/Source/JavaScriptCore/parser/ |
| JSParser.cpp | 73 JSParser(Lexer*, JSGlobalData*, FunctionParameters*, bool isStrictContext, bool isFunction, SourceProvider*);
101 void next(Lexer::LexType lexType = Lexer::IdentifyReservedWords)
248 Lexer* m_lexer;
615 JSParser parser(globalData->lexer, globalData, parameters, strictness == JSParseStrict, parserMode == JSParseFunctionCode, source->provider());
619 JSParser::JSParser(Lexer* lexer, JSGlobalData* globalData, FunctionParameters* parameters, bool inStrictContext, bool isFunction, SourceProvider* provider)
620 : m_lexer(lexer)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| NFAFactory.java | 191 /** For a non-lexer, just build a simple token reference atom.
192 * For a lexer, a string is a sequence of char to match. That is,
198 if ( nfa.grammar.type==Grammar.LEXER ) {
312 * in the case of a lexer grammar, an EOT token when the conversion
318 if ( nfa.grammar.type==Grammar.LEXER ) {
|
| /external/bison/data/ |
| lalr1.java | 113 public interface Lexer {
146 b4_lexer_if([[private class YYLexer implements Lexer {
147 ]b4_percent_code_get([[lexer]])[
151 private Lexer yylexer;
169 b4_lexer_if([[protected]], [[public]]) b4_parser_class_name[ (]b4_parse_param_decl([[Lexer yylexer]])[) {
|
| /external/clang/lib/Lex/ |
| TokenLexer.cpp | 414 // Pop this context off the preprocessors lexer stack and get the next
554 // a lexer and other overhead.
575 // Make a lexer to lex this string from. Lex just this one token.
576 // Make a lexer object so that we lex and expand the paste result.
577 Lexer TL(SourceMgr.getLocForStartOfFile(LocFileID),
|
| Pragma.cpp | 281 // Make and enter a lexer object so that we lex and expand the tokens just
283 Lexer *TL = Lexer::Create_PragmaLexer(TokLoc, PragmaLoc, RParenLoc,
352 // Get the current file lexer we're looking at. Ignore _Pragma 'files' etc.
358 assert(CurPPLexer && "No current lexer?");
416 // Get the current file lexer we're looking at. Ignore _Pragma 'files' etc.
[all...] |
| MacroArgs.cpp | 50 // Allocate memory for a MacroArgs object with the lexer tokens at the end.
226 std::string Str = Lexer::Stringify(TokStr);
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestAttributes.java | [all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/ |
| jdimodel.jar | |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| BaseRecognizer.cs | 51 * lexer, parser, and tree grammars. This is all the parsing
68 * State of a lexer, parser, or tree parser are collected into a state
320 * Get number of recognition errors (lexer, parser, tree parser). Each
321 * recognizer tracks its own number. So parser and lexer each have
345 * your token objects because you don't have to go modify your lexer
693 * If you change what tokens must be created by the lexer,
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| BaseRecognizer.cs | 52 * lexer, parser, and tree grammars. This is all the parsing
70 * State of a lexer, parser, or tree parser are collected into a state
373 * Get number of recognition errors (lexer, parser, tree parser). Each
374 * recognizer tracks its own number. So parser and lexer each have
405 * your token objects because you don't have to go modify your lexer
[all...] |
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
| JUnitCodeGen.java | 109 String lexerName = grammarInfo.getGrammarName()+"Lexer";
207 // need to determine whether it's a test for parser rule or lexer rule
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3tokenstream.h | 75 /// lexer rule said to just skip the generated token altogether.
88 * name from whence the tokens were produced by the lexer. This pointer is a
|
| antlr3intstream.h | 16 * For instance, a lexer implements a pANTLR3_BASE_RECOGNIZER, within which there is a pANTLR3_INT_STREAM.
|
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| t042ast.html | 41 lexer = new TLexer(cstream),
42 tstream = new org.antlr.runtime.CommonTokenStream(lexer),
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| exceptions.py | 48 the various reporting methods in Parser and Lexer can be overridden
98 # generated from a lexer. We need to track this since the
|
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t042ast.py | 29 self.lexer = self.getLexer(cStream)
30 tStream = antlr3.CommonTokenStream(self.lexer)
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
| wizard.rb | 187 lexer = PatternLexer.new( pattern )
188 new( lexer, token_scheme, adaptor ).pattern
|
| /external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
| XPathParser.java | 110 Lexer lexer = new Lexer(compiler, namespaceContext, this); local
112 lexer.tokenize(expression);
186 Lexer lexer = new Lexer(compiler, namespaceContext, this); local
188 lexer.tokenize(expression);
[all...] |
| /external/clang/lib/ARCMigrate/ |
| TransRetainReleaseDealloc.cpp | 25 #include "clang/Lex/Lexer.h"
337 StringRef MacroName = Lexer::getImmediateMacroName(Loc, SM,
|
| /external/llvm/lib/TableGen/ |
| TGLexer.cpp | 1 //===- TGLexer.cpp - Lexer for TableGen -----------------------------------===//
10 // Implement the Lexer for TableGen.
|
| /cts/tools/dasm/src/java_cup/ |
| parse_action_table.java | 97 lexer.warning_count++;
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| DFA.as | 12 * lexer's Tokens rule DFA has 326 states roughly.
|
