Searched refs:left (Results 1 - 25 of 2877) sorted by path

1234567891011>>

/external/aac/libAACenc/src/
H A Dchaosmeasure.cpp110 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 Dchecksum.c37 int left = len; local
40 while(left > 1) {
43 left -= 2;
45 if(left) {
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-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 DCommonErrorNode.as22 // in follow set. So, stop will be 1 to left to start. adjust.
H A DRewriteRuleNodeStream.as4 /** 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 DAntlr.Runtime.Tree.Tests.pas718 /// is more room left.
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas171 /// 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 DAntlr.Runtime.pas2777 /// 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 Derror.rb517 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 Dvisitor.rb43 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 Dprofile-mode.rb18 /** In this rule, the functionHeader left prefix on the last two
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/
H A Dll-star.rb23 /** 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 DTreeToNFAConverter.g245 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 DSemanticContext.java434 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 DStateCluster.java30 /** 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 DLeftRecursiveRuleAnalyzer.java14 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 DNFAFactory.java85 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 DActionScript.stg1026 andPredicates(left,right) ::= "(<left>&&<right>)"
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/
H A DC.stg2276 // 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 DCPP.stg1125 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 DCSharp2.stg1095 // 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 DCSharp3.stg1075 // 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 DDelphi.stg1485 andPredicates(left,right) ::= "((<left>) and (<right>))"
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/
H A DJava.stg855 // 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 DObjC.stg1328 // used for left-recursive rules
1628 andPredicates(left,right) ::= "(<left>&&<right>)"

Completed in 678 milliseconds

1234567891011>>