Searched refs:Tokens (Results 1 - 25 of 78) sorted by relevance
1234
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | Tokens.cs | 35 public static class Tokens class in namespace:Antlr.Runtime
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | TreeConstants.cs | 37 public static readonly ITree INVALID_NODE = new CommonTree( Tokens.Invalid );
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | TokenConstants.cs | 65 public static class Tokens class in namespace:Antlr.Runtime 67 public static readonly IToken EndOfFile = Tokens<CommonToken>.EndOfFile; 79 public static class Tokens<T>
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/combined/ |
H A D | CombinedLexer.h | 16 #pragma mark Tokens
|
H A D | CombinedParser.h | 13 #pragma mark Tokens
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/lexertest-simple/ |
H A D | TestLexer.h | 15 #pragma mark Tokens
|
H A D | TestLexerLexer.h | 16 #pragma mark Tokens
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/lexertest-simple/output1/ |
H A D | TestLexer.h | 15 #pragma mark Tokens
|
H A D | TestLexerLexer.h | 15 #pragma mark Tokens
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/output1/ |
H A D | TreeRewriteLexer.h | 16 #pragma mark Tokens
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
H A D | token.ml | 2 * Lexer Tokens
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
H A D | token.ml | 2 * Lexer Tokens
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
H A D | token.ml | 2 * Lexer Tokens
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/hoistedPredicates/ |
H A D | TLexer.h | 16 #pragma mark Tokens
|
H A D | TParser.h | 25 #pragma mark Tokens
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
H A D | TreeRewriteLexer.h | 16 #pragma mark Tokens
|
/external/llvm/lib/MC/MCDisassembler/ |
H A D | EDInst.cpp | 47 unsigned int numTokens = Tokens.size(); 50 delete Tokens[index]; 175 return TokenizeResult.setResult(EDToken::tokenize(Tokens, 185 return Tokens.size(); 191 token = Tokens[index]; 202 for (iter = Tokens.begin(); iter != Tokens.end(); ++iter) {
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/ |
H A D | SymbolTableLexer.h | 16 #pragma mark Tokens
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
H A D | LangLexer.h | 16 #pragma mark Tokens
|
/external/clang/lib/Lex/ |
H A D | TokenLexer.cpp | 40 Tokens = &*Macro->tokens_begin(); 50 assert(Tokens[0].getLocation().isValid()); 51 assert((Tokens[0].getLocation().isFileID() || Tokens[0].is(tok::comment)) && 56 // definition. Tokens that get lexed directly from the definition will 59 MacroDefStart = SM.getExpansionLoc(Tokens[0].getLocation()); 68 // Tokens to point to the expanded tokens. 90 Tokens = TokArray; 113 delete [] Tokens; 114 Tokens [all...] |
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
H A D | token.ml | 2 * Lexer Tokens
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
H A D | token.ml | 2 * Lexer Tokens
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
H A D | token.ml | 2 * Lexer Tokens
|
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
H A D | test-tree-wizard.rb | 84 Tokens = TokenScheme.build %w(A B C D E ID VAR) 85 include Tokens 88 @adaptor = CommonTreeAdaptor.new( Tokens.token_class ) 89 @pattern_adaptor = Wizard::PatternAdaptor.new( Tokens.token_class ) 90 @wizard = Wizard.new( :adaptor => @adaptor, :token_scheme => Tokens ) 95 tree = Wizard::PatternParser.parse( 'ID', Tokens, @adaptor ) 103 tree = Wizard::PatternParser.parse( 'ID[foo]', Tokens, @adaptor ) 111 tree = Wizard::PatternParser.parse( '(A B)', Tokens, @adaptor ) 122 tree = Wizard::PatternParser.parse( 'nil', Tokens, @adaptor ) 130 tree = Wizard::PatternParser.parse( '(.)', Tokens, [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/LL-star/ |
H A D | SimpleCLexer.h | 16 #pragma mark Tokens
|
Completed in 216 milliseconds
1234