/external/antlr/antlr-3.4/gunit/src/main/antlr3/org/antlr/gunit/ |
H A D | gUnit.g | 197 int c = input.LA(-1); 200 c = input.LA(--i);
|
/external/antlr/antlr-3.4/gunit/src/main/antlr3/org/antlr/gunit/swingui/parsers/ |
H A D | ANTLRv3.g | 474 : '/*' {if (input.LA(1)=='*') $type=DOC_COMMENT; else $channel=HIDDEN;} .* '*/'
|
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/ |
H A D | FlexAntTasks.jar | META-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | ANTLRStringStream.as | 94 public function LA(i:int):int { function 99 i++; // e.g., translate LA(-1) to use offset i=0; then data[p+0-1] 112 return LA(i); 117 * be returned from LA(1).
|
H A D | BaseRecognizer.as | 67 if ( input.LA(1)==ttype ) { 89 return input.LA(2)==ttype; 115 if ( follow.member(input.LA(1)) || follow.member(TokenConstants.EOR_TOKEN_TYPE) ) { 411 * In this case, for input "[]", LA(1) is in this set so we would 415 * exception (since LA(1) is not in the viable following token 495 * token mismatch. Upon token mismatch, if LA(1) is member of 531 * LA(1) is not what we are looking for. If LA(2) has the right token, 532 * however, then assume LA(1) is some extra spurious token. Delete it 533 * and LA( [all...] |
H A D | CommonTokenStream.as | 288 public function LA(i:int):int { function
|
H A D | DFA.as | 70 if ( debug ) trace("DFA "+decisionNumber+" state "+s+" LA(1)="+String.fromCharCode(input.LA(1))+"("+input.LA(1)+ 95 var c:int = input.LA(1); // -1 == \uFFFF, all tokens fit in 65000 space
|
H A D | IntStream.as | 36 * Negative indexes are allowed. LA(-1) is previous token (token 37 * just matched). LA(-i) where i is before first token should 40 function LA(i:int):int; 104 * The index is 0..n-1. A seek to position i means that LA(1) will 105 * return the ith symbol. So, seeking to 0 means LA(1) will return the
|
H A D | Lexer.as | 73 if ( input.LA(1)==CharStreamConstants.EOF ) { 157 if ( input.LA(1) != s.charCodeAt(i) ) { 178 if ( input.LA(1)!=c ) { 194 if ( input.LA(1)<a || input.LA(1)>b ) {
|
H A D | RecognitionException.as | 114 this.c = input.LA(1); 119 this.c = input.LA(1);
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | CommonTreeNodeStream.as | 272 public function LA(i:int):int { function
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/test/org/antlr/runtime/test/ |
H A D | TestANTLRStringStream.as | 44 assertEquals(stream.LA(-1), CharStreamConstants.EOF); // should be EOF 45 assertEquals(stream.LA(0), 0); // should be 0 (undefined) 46 assertEquals(stream.LA(1), "a".charCodeAt(0)); 47 assertEquals(stream.LA(2), "b".charCodeAt(0)); 48 assertEquals(stream.LA(3), "c".charCodeAt(0)); 49 assertEquals(stream.LA(4), CharStreamConstants.EOF); 53 assertEquals(stream.LA(-2), CharStreamConstants.EOF); 54 assertEquals(stream.LA(-1), "a".charCodeAt(0)); 55 assertEquals(stream.LA(0), 0); // should be 0 (undefined) 56 assertEquals(stream.LA( [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
H A D | ANTLRxxxxStreamFixture.cs | 126 Console.Out.Write((char)inputStream.LA(1)); 210 Assert.AreEqual('e', inputStream.LA(1)); 214 Assert.AreEqual('O', inputStream.LA(1)); 220 Assert.AreEqual('n', inputStream.LA(1)); 226 Assert.AreEqual('e', inputStream.LA(1)); 261 Assert.AreEqual('O', stream.LA(1)); 267 Assert.AreEqual('w', stream.LA(1)); 273 Assert.AreEqual('h', stream.LA(1)); 280 Assert.AreEqual('n', stream.LA(1)); 382 Assert.AreEqual('e', stream.LA( [all...] |
H A D | ITreeNodeStreamFixture.cs | 497 while (stream.LA(1) != Token.EndOfFile)
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
H A D | DebugTokenStream.cs | 110 public virtual int LA(int i) { method in class:Antlr.Runtime.Debug.DebugTokenStream 115 return input.LA(i);
|
H A D | DebugTreeNodeStream.cs | 129 public virtual int LA(int i) { method in class:Antlr.Runtime.Debug.DebugTreeNodeStream
|
H A D | Tracer.cs | 84 return (char) input.LA(k);
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | BufferedTreeNodeStream.cs | 384 public virtual int LA(int i) { method in class:Antlr.Runtime.Tree.BufferedTreeNodeStream
|
H A D | CommonTreeNodeStream.cs | 164 public virtual int LA(int i) { method in class:Antlr.Runtime.Tree.CommonTreeNodeStream
|
H A D | TreeParser.cs | 117 int look = input.LA(1); 122 switch (input.LA(1)) {
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | ANTLRStringStream.cs | 114 * be returned from LA(1). 169 public virtual int LA(int i) { method in class:Antlr.Runtime.ANTLRStringStream 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);
|
H A D | BaseRecognizer.cs | 134 if (input.LA(1) == ttype) { 156 return input.LA(2) == ttype; 183 if (follow.Member(input.LA(1)) || follow.Member(TokenTypes.EndOfRule)) { 462 * In this case, for input "[]", LA(1) is in this set so we would 466 * exception (since LA(1) is not in the viable following token 548 * token mismatch. Upon token mismatch, if LA(1) is member of 591 * LA(1) is not what we are looking for. If LA(2) has the right token, 592 * however, then assume LA(1) is some extra spurious token. Delete it 593 * and LA( [all...] |
H A D | BufferedTokenStream.cs | 242 public virtual int LA(int i) { method in class:Antlr.Runtime.BufferedTokenStream
|
H A D | DFA.cs | 92 Console.Error.WriteLine("DFA " + decisionNumber + " state " + s + " LA(1)=" + (char)input.LA(1) + "(" + input.LA(1) + 118 char c = (char)input.LA(1); // -1 == \uFFFF, all tokens fit in 65000 space
|