OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Tokens
(Results
1 - 25
of
111
) sorted by null
1
2
3
4
5
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
Tokens.cs
35
public static class
Tokens
/frameworks/compile/mclinker/include/mcld/Script/
StringList.h
27
typedef std::vector<StrToken*>
Tokens
;
28
typedef
Tokens
::const_iterator const_iterator;
29
typedef
Tokens
::iterator iterator;
30
typedef
Tokens
::const_reference const_reference;
31
typedef
Tokens
::reference reference;
62
Tokens
m_Tokens;
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
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/
TokenConstants.cs
38
* All
tokens
go to the parser (unless skip() is called in that rule)
65
public static class
Tokens
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/
CombinedLexer.h
16
#pragma mark
Tokens
CombinedParser.h
13
#pragma mark
Tokens
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/lexertest-simple/
TestLexer.h
15
#pragma mark
Tokens
TestLexerLexer.h
16
#pragma mark
Tokens
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/lexertest-simple/output1/
TestLexer.h
15
#pragma mark
Tokens
TestLexerLexer.h
15
#pragma mark
Tokens
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/output1/
TreeRewriteLexer.h
16
#pragma mark
Tokens
/external/ImageMagick/MagickWand/tests/
script-token-test-data.txt
30
'Empty
Tokens
, using quotes'
/external/clang/lib/Format/
TokenAnnotator.h
42
: First(Line.
Tokens
.front().Tok), Level(Line.Level),
47
assert(!Line.
Tokens
.empty());
49
// Calculate Next and Previous for all
tokens
. Note that we must overwrite
54
for (std::list<UnwrappedLineNode>::const_iterator I = ++Line.
Tokens
.begin(),
55
E = Line.
Tokens
.end();
83
/// \c true if this line starts with the given
tokens
in order, ignoring
85
template <typename... Ts> bool startsWith(Ts...
Tokens
) const {
86
return startsWith(First,
Tokens
...);
134
bool startsWith(FormatToken *Tok, A K1, Ts...
Tokens
) const {
135
return startsWith(Tok, K1) && startsWith(Tok->Next,
Tokens
...)
[
all
...]
UnwrappedLineParser.h
12
/// which turns a stream of
tokens
into UnwrappedLines.
40
/// \brief The \c
Tokens
comprising this \c UnwrappedLine.
41
std::list<UnwrappedLineNode>
Tokens
;
65
ArrayRef<FormatToken *>
Tokens
,
163
FormatTokenSource *
Tokens
;
167
// of the format
tokens
. The goal is to have the actual
tokens
created and
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/
token.ml
2
* Lexer
Tokens
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/
token.ml
2
* Lexer
Tokens
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
token.ml
2
* Lexer
Tokens
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/hoistedPredicates/
TLexer.h
16
#pragma mark
Tokens
TParser.h
25
#pragma mark
Tokens
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/
TreeRewriteLexer.h
16
#pragma mark
Tokens
/external/clang/lib/Lex/
TokenLexer.cpp
41
Tokens
= &*Macro->tokens_begin();
51
assert(
Tokens
[0].getLocation().isValid());
52
assert((
Tokens
[0].getLocation().isFileID() ||
Tokens
[0].is(tok::comment)) &&
57
// definition.
Tokens
that get lexed directly from the definition will
60
MacroDefStart = SM.getExpansionLoc(
Tokens
[0].getLocation());
69
//
Tokens
to point to the expanded
tokens
.
91
Tokens
= TokArray;
113
// the expanded
tokens
[
all
...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/
SymbolTableLexer.h
16
#pragma mark
Tokens
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/
LangLexer.h
16
#pragma mark
Tokens
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
token.ml
2
* Lexer
Tokens
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
token.ml
2
* Lexer
Tokens
Completed in 387 milliseconds
1
2
3
4
5