/external/aac/libAACenc/src/ |
H A D | chaosmeasure.cpp | 110 FIXP_DBL left,center; /* left, center tap of filter */ local 112 left = (FIXP_DBL)((LONG)paMDCTDataNM0[i]^((LONG)paMDCTDataNM0[i]>>(DFRACT_BITS-1))); 117 FIXP_DBL tmp = (left>>1)+(right>>1); 128 left = center;
|
/external/android-clat/ |
H A D | checksum.c | 37 int left = len; local 40 while(left > 1) { 43 left -= 2; 45 if(left) {
|
/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/src/org/antlr/runtime/tree/ |
H A D | CommonErrorNode.as | 22 // in follow set. So, stop will be 1 to left to start. adjust.
|
H A D | RewriteRuleNodeStream.as | 4 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
H A D | Antlr.Runtime.Tree.Tests.pas | 718 /// is more room left.
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.Tree.pas | 171 /// Flat trees such as for lists like "idlist : ID+ ;" are left alone 837 /// Queues up nodes matched on left side of -> in a tree parser. This is 2621 // in follow set). So, stop will be 1 to left to start. adjust.
|
H A D | Antlr.Runtime.pas | 2777 /// 2. for any prior replace with same left boundary, combine this 6236 IndexToOp.Remove(I); // remove so any left have index size-1
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | error.rb | 517 on the left side of a rewrite rule and the number of the same symbol
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
H A D | visitor.rb | 43 through each node of the tree (top-down left-to-right). If +pre_action+ is
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/debugging/ |
H A D | profile-mode.rb | 18 /** In this rule, the functionHeader left prefix on the last two
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
H A D | ll-star.rb | 23 /** In this rule, the functionHeader left prefix on the last two
|
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
H A D | TreeToNFAConverter.g | 245 start.addTransition(new Transition(Label.EPSILON, g.left)); 248 if ( grammar.getNumberOfAltsForDecisionNFA(g.left)>1 ) 250 g.left.setDescription(grammar.grammarTreeToString($start, false)); 251 g.left.setDecisionASTNode($b.start); 252 int d = grammar.assignDecisionNumber( g.left ); 253 grammar.setDecisionNFA( d, g.left ); 390 if ( grammar.getNumberOfAltsForDecisionNFA($b.g.left)>1 ) 392 $b.g.left.setDescription(grammar.grammarTreeToString(blk, false)); 393 $b.g.left.setDecisionASTNode(blk); 394 int d = grammar.assignDecisionNumber( $b.g.left ); [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | SemanticContext.java | 434 public abstract SemanticContext combinePredicates(SemanticContext left, SemanticContext right); argument 463 eST = new ST("(<left>&&<right>)"); 465 eST.add("left", result); 479 public SemanticContext combinePredicates(SemanticContext left, SemanticContext right) { argument 480 return SemanticContext.and(left, right); 527 public SemanticContext combinePredicates(SemanticContext left, SemanticContext right) { argument 528 return SemanticContext.or(left, right);
|
H A D | StateCluster.java | 30 /** A Cluster object points to the left/right (start and end) states of a 34 public NFAState left; field in class:StateCluster 37 public StateCluster(NFAState left, NFAState right) { argument 38 this.left = left;
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | LeftRecursiveRuleAnalyzer.java | 14 public static enum ASSOC { left, right }; enum constant in enum:LeftRecursiveRuleAnalyzer.ASSOC 64 ASSOC assoc = ASSOC.left; 316 if ( altAssociativity.get(alt)==ASSOC.left ) p++;
|
H A D | NFAFactory.java | 85 NFAState s = alt.left; 119 NFAState left = newState(); 121 left.associatedASTNode = associatedAST; 123 transitionBetweenStates(left, right, label); 124 StateCluster g = new StateCluster(left, right); 134 * what an alt block looks like, must have extra state on left. 137 NFAState left = newState(); 139 left.associatedASTNode = associatedAST; 143 left.addTransition(e); 144 StateCluster g = new StateCluster(left, righ [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
H A D | ActionScript.stg | 1026 andPredicates(left,right) ::= "(<left>&&<right>)"
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
H A D | C.stg | 2276 // used for left-recursive rules 2630 andPredicates(left,right) ::= "( (<left>) && (<right>) )"
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CPP/ |
H A D | CPP.stg | 1125 andPredicates(left,right) ::= "(<left> && <right>)" 1226 * I could have left actions as StringTemplates to be inserted in
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
H A D | CSharp2.stg | 1095 // used for left-recursive rules 1401 andPredicates(left,right) ::= "(<left>&&<right>)"
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
H A D | CSharp3.stg | 1075 // used for left-recursive rules 1380 andPredicates(left,right) ::= "(<left>&&<right>)"
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
H A D | Delphi.stg | 1485 andPredicates(left,right) ::= "((<left>) and (<right>))"
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
H A D | Java.stg | 855 // used for left-recursive rules 1129 andPredicates(left,right) ::= "(<left>&&<right>)"
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
H A D | ObjC.stg | 1328 // used for left-recursive rules 1628 andPredicates(left,right) ::= "(<left>&&<right>)"
|