| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| BaseRecognizer.java | 105 if ( input.LA(1)==ttype ) {
127 return input.LA(2)==ttype;
154 if ( follow.member(input.LA(1)) || follow.member(Token.EOR_TOKEN_TYPE) ) {
435 * In this case, for input "[]", LA(1) is in this set so we would
439 * exception (since LA(1) is not in the viable following token
519 * token mismatch. Upon token mismatch, if LA(1) is member of
563 * LA(1) is not what we are looking for. If LA(2) has the right token,
564 * however, then assume LA(1) is some extra spurious token. Delete it
565 * and LA(2) as if we were doing a normal match(), which advances th
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| SimpleCTP.m | 291 NSInteger LA1_0 = [input LA:1];
354 unichar charLA2 = [input LA:1];
573 NSInteger LA3_0 = [input LA:1];
693 if ([input LA:1] == K_CHAR||[input LA:1] == K_ID||[input LA:1] == K_INT_TYPE||[input LA:1] == K_VOID) {
735 if ( [input LA:1] == DOWN ) {
739 NSInteger LA4_0 = [input LA:1];
769 NSInteger LA5_0 = [input LA:1]
[all...] |
| /external/bison/src/ |
| lalr.c | 57 /* LA is an NLA by NTOKENS matrix of bits. LA[l, i] is 1 if the rule
59 token is symbol i. If LA[l, i] and LA[l, j] are both 1 for i != j,
62 static bitsetv LA = NULL;
211 sp->next = lookback[(s->reductions->lookahead_tokens - LA) + ri];
213 lookback[(s->reductions->lookahead_tokens - LA) + ri] = sp;
313 bitset_or (LA[i], LA[i], goto_follows[sp->value]);
363 | Compute LA, NLA, and the lookahead_tokens members.
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CPP/ |
| CPP.stg | 223 if ( input.LA(1)==CharStream.EOF ) {
718 <tokenid_type()> <label> = input.LA(1);<\n>
745 MismatchedSetException mse(input.getPosition(),input.LA(1));
791 <tokenid_type()> <label> = input.LA(1);<\n>
854 if ( input.LA(1)==antlr3::Token::DOWN ) {
883 <tokenid_type()> LA<decisionNumber>_<stateNumber> = input.LA(<k>);<\n>
902 * expect "if ( LA(1)==X ) match(X);" and that's it.
906 <tokenid_type()> LA<decisionNumber>_<stateNumber> = input.LA(<k>)
[all...] |
| /external/webkit/Source/WebKit/android/content/ |
| address_detector.cpp | 691 LA = 21, // LA Louisiana
803 LA, LA, XX, LA, LA, LA, LA, LA, LA, XX, // 700-70
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
| SimpleCTP.m | 287 NSInteger LA1_0 = [input LA:1];
341 switch ([input LA:1]) {
518 NSInteger LA3_0 = [input LA:1];
616 if ((([input LA:1] >= K_ID) && ([input LA:1] <= K_VOID))) {
652 if ( [input LA:1] == ANTLRTokenTypeDOWN ) {
656 NSInteger LA4_0 = [input LA:1];
683 NSInteger LA5_0 = [input LA:1];
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Interpreter.java | 83 if ( input.LA(1)==CharStream.EOF ) {
90 while (input.LA(1)!=CharStream.EOF) {
224 int t = input.LA(1);
343 t = input.LA(1);
397 int c = input.LA(1);
413 c = input.LA(1);
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| ANTLRStringStream.cs | 114 * be returned from LA(1).
169 public virtual int LA(int i) {
174 i++; // e.g., translate LA(-1) to use offset i=0; then data[p+0-1]
181 //System.out.println("char LA("+i+")=EOF; p="+p);
184 //System.out.println("char LA("+i+")="+(char)data[p+i-1]+"; p="+p);
185 //System.out.println("LA("+i+"); p="+p+" n="+n+" data.length="+data.length);
190 return LA(i);
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeParser.cs | 117 int look = input.LA(1);
122 switch (input.LA(1)) {
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| ANTLRStringStream.cs | 121 * be returned from LA(1).
188 public virtual int LA( int i )
196 i++; // e.g., translate LA(-1) to use offset i=0; then data[p+0-1]
205 //System.out.println("char LA("+i+")=EOF; p="+p);
208 //System.out.println("char LA("+i+")="+(char)data[p+i-1]+"; p="+p);
209 //System.out.println("LA("+i+"); p="+p+" n="+n+" data.length="+data.length);
215 return LA( i );
|
| UnbufferedTokenStream.cs | 157 public int LA(int i)
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeParser.cs | 128 int look = input.LA( 1 );
135 switch ( input.LA( 1 ) )
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/combined/ |
| CombinedParser.m | 128 NSInteger LA1_0 = [input LA:1];
|
| /external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
| ANTLRStringStream.pm | 106 sub LA {
114 ++$i; # e.g., translate LA(-1) to use offset i=0; then input[p+0-1]
130 return $self->LA($i);
|
| BaseRecognizer.pm | 70 if ($input->LA(1) eq $ttype) {
97 return $input->LA(2) == $ttype;
115 if ($follow->member($input->LA(1)) || $follow->member(ANTLR::Runtime::Token->EOR_TOKEN_TYPE)) {
394 if ($follow->member($input->LA(1))) {
424 my $ttype = $input->LA(1);
427 $ttype = $input->LA(1);
432 my $ttype = $input->LA(1);
435 $ttype = $input->LA(1);
|
| Lexer.pm | 59 if ($self->input->LA(1) eq ANTLR::Runtime::CharStream->EOF) {
163 if ($self->input->LA(1) ne $c) {
189 if ($self->input->LA(1) lt $a || $self->input->LA(1) gt $b) {
|
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| ANTLRTreePrinter.g | 243 if ( input.LA(5) == NOT || input.LA(5) == ASSIGN )
264 if ( input.LA(5) == NOT || input.LA(5) == ASSIGN )
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| ActionScript.stg | 116 if ( input.LA(1)==CharStreamConstants.EOF ) {
645 <label> = input.LA(1);<\n>
653 <label> = input.LA(1);<\n>
662 <label>= input.LA(1);<\n>
722 <label> = input.LA(1);<\n>
794 if ( input.LA(1)==TokenConstants.DOWN ) {
819 var LA<decisionNumber>_<stateNumber>:int = input.LA(<k>);<\n>
835 * expect "if ( LA(1)==X ) match(X);" and that's it.
838 var LA<decisionNumber>_<stateNumber>:int = input.LA(<k>);<\n
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| Java.stg | 143 if ( input.LA(1)==CharStream.EOF ) {
702 <label> = input.LA(1);<\n>
710 <label> = input.LA(1);<\n>
719 <label>= input.LA(1);<\n>
785 <label> = input.LA(1);<\n>
868 if ( input.LA(1)==Token.DOWN ) {
893 int LA<decisionNumber>_<stateNumber> = input.LA(<k>);<\n>
911 * expect "if ( LA(1)==X ) match(X);" and that's it.
914 int LA<decisionNumber>_<stateNumber> = input.LA(<k>);<\n
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
| Perl5.stg | 136 if ( input.LA(1)==CharStream.EOF ) {
678 <label> = $self->input->LA(1);<\n>
686 <label> = $self->input->LA(1);<\n>
695 <label>= $self->input->LA(1);<\n>
758 <label> = $self->input->LA(1);<\n>
827 if ( input.LA(1)==Token.DOWN ) {
852 my $LA<decisionNumber>_<stateNumber> = $self->input->LA(<k>);<\n>
875 * expect "if ( LA(1)==X ) match(X);" and that's it.
878 my $LA<decisionNumber>_<stateNumber> = $self->input->LA(<k>);<\n
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Scala/ |
| Scala.stg | 124 if ( input.LA(1)==CharStream.EOF ) {
683 <label> = input.LA(1)<\n>
692 <label> = input.LA(1)<\n>
701 <label>= input.LA(1)<\n>
770 <label> = input.LA(1)<\n>
858 if ( input.LA(1)==Token.DOWN ) {
887 val LA<decisionNumber>_<stateNumber> = input.LA(<k>)<\n>
904 * expect "if ( LA(1)==X ) match(X);" and that's it.
907 val LA<decisionNumber>_<stateNumber> = input.LA(<k>)<\n
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRCommonTreeNodeStream.h | 93 - (NSInteger) LA:(NSInteger) i;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRCommonTreeNodeStream.h | 93 - (NSInteger) LA:(NSInteger) i;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRCommonTreeNodeStream.h | 93 - (NSInteger) LA:(NSInteger) i;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRStringStream.h | 72 - (NSInteger) LA:(NSInteger) i;
|
