| /external/smali/smali/src/main/java/org/jf/smali/ |
| D | smaliParser.java | 489 CommonTree root_0 = null; in smali_file() local
659 retval.tree = root_0; in smali_file()
662 root_0 = (CommonTree)adaptor.nil(); in smali_file()
715 adaptor.addChild(root_0, root_1); in smali_file()
721 retval.tree = root_0; in smali_file()
727 retval.tree = (CommonTree)adaptor.rulePostProcessing(root_0); in smali_file()
759 CommonTree root_0 = null; in class_spec() local
794 retval.tree = root_0; in class_spec()
797 root_0 = (CommonTree)adaptor.nil(); in class_spec()
800 adaptor.addChild(root_0, stream_CLASS_DESCRIPTOR.nextNode()); in class_spec()
[all …]
|
| /external/antlr/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| D | SimpleCParser.java | 76 Object root_0 = null; in program() local
86 root_0 = (Object)adaptor.nil(); in program()
109 adaptor.addChild(root_0, declaration1.getTree()); in program()
128 retval.tree = (Object)adaptor.rulePostProcessing(root_0); in program()
155 Object root_0 = null; in declaration() local
179 root_0 = (Object)adaptor.nil(); in declaration()
186 adaptor.addChild(root_0, variable2.getTree()); in declaration()
211 retval.tree = root_0; in declaration()
214 root_0 = (Object)adaptor.nil(); in declaration()
224 adaptor.addChild(root_0, root_1); in declaration()
[all …]
|
| D | SimpleCParser.m | 982 CommonTree *root_0 = nil;
994 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
1021 [treeAdaptor addChild:[declaration1 getTree] toTree:root_0];
1047 retval.tree = (CommonTree *)[treeAdaptor rulePostProcessing:root_0];
1081 CommonTree *root_0 = nil;
1112 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
1124 [treeAdaptor addChild:[variable2 getTree] toTree:root_0];
1152 retval.tree = root_0;
1158 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
1171 [treeAdaptor addChild:root_1 toTree:root_0];
[all …]
|
| /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
| D | ProfileGrammarParser.cs | 140 CommonTree root_0 = null; in prog()
162 root_0 = (CommonTree)adaptor.Nil(); in prog()
204 adaptor.AddChild(root_0, stat1.Tree); in prog()
228 retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0); in prog()
272 CommonTree root_0 = null; in stat()
357 retval.tree = root_0; in stat()
360 root_0 = (CommonTree)adaptor.Nil(); in stat()
364 adaptor.AddChild(root_0, stream_expr.NextTree()); in stat()
368 retval.tree = root_0; in stat()
407 retval.tree = root_0; in stat()
[all …]
|
| D | DebugGrammarParser.cs | 136 CommonTree root_0 = null; in prog()
158 root_0 = (CommonTree)adaptor.Nil(); in prog()
200 adaptor.AddChild(root_0, stat1.Tree); in prog()
224 retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0); in prog()
268 CommonTree root_0 = null; in stat()
353 retval.tree = root_0; in stat()
356 root_0 = (CommonTree)adaptor.Nil(); in stat()
360 adaptor.AddChild(root_0, stream_expr.NextTree()); in stat()
364 retval.tree = root_0; in stat()
403 retval.tree = root_0; in stat()
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Ruby/ |
| D | ASTParser.stg | 19 @adaptor.add_child( root_0, tree_for_<label> )
29 root_0 = @adaptor.become_root( tree_for_<label>, root_0 )
49 <super.matchSet(postmatchCode={<gatedAction({@adaptor.add_child( root_0, <createNodeFromToken(...)>…
63 …super.matchSet(postmatchCode={<gatedAction({root_0 = @adaptor.become_root( <createNodeFromToken(..…
74 <gatedAction({@adaptor.add_child( root_0, <label; format="label">.tree )})>
85 <gatedAction({root_0 = @adaptor.become_root( <label; format="label">.tree, root_0 )})>
113 @adaptor.add_child( root_0, tree_for_<label> )
123 root_0 = @adaptor.become_root( tree_for_<label>, root_0 )
138 return_value.tree = @adaptor.rule_post_processing( root_0 )
|
| D | AST.stg | 18 root_0 = nil<\n>
33 root_0 = @adaptor.create_flat_list<\n><\n>
97 <prevRuleRootRef(); format="label">.tree = root_0
99 root_0 = @adaptor.create_flat_list
107 <prevRuleRootRef(); format="label">.tree = @adaptor.rule_post_processing( root_0 )
119 <prevRuleRootRef(); format="label">.tree = root_0<\n>
122 <prevRuleRootRef(); format="label">.tree = root_0<\n>
216 rewriteEmptyAlt() ::= "root_0 = nil"
263 root_0 = ( <action> )<\n>
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
| D | ASTParser.stg | 25 this.adaptor.addChild(root_0, <label>_tree);
37 root_0 = this.adaptor.becomeRoot(<label>_tree, root_0);
73 …>if ( <actions.(actionScope).synpredgate> ) <endif>this.adaptor.addChild(root_0, <createNodeFromTo…
89 …ctions.(actionScope).synpredgate> ) <endif>root_0 = this.adaptor.becomeRoot(<createNodeFromToken(.…
97 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>this.adaptor.addChild(root_0, <…
106 …( <actions.(actionScope).synpredgate> ) <endif>root_0 = this.adaptor.becomeRoot(<label>.getTree(),…
133 this.adaptor.addChild(root_0, <label>_tree);
143 root_0 = this.adaptor.becomeRoot(<label>_tree, root_0);
158 retval.tree = this.adaptor.rulePostProcessing(root_0);
|
| D | AST.stg | 58 var root_0 = null;<\n>
80 root_0 = this.adaptor.nil();<\n>
165 <prevRuleRootRef()>.tree = root_0;
167 root_0 = this.adaptor.nil();
172 <prevRuleRootRef()>.tree = this.adaptor.rulePostProcessing(root_0);
181 <prevRuleRootRef()>.tree = root_0;
184 <prevRuleRootRef()>.tree = root_0;
277 rewriteEmptyAlt() ::= "root_0 = null;"
334 root_0 = <action>;<\n>
339 * variable 'tree' sitting in retval struct to hold the value of root_0 right
|
| /external/antlr/runtime/ObjC/Framework/examples/polydiff/ |
| D | PolyParser.m | 272 CommonTree *root_0 = nil;
287 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
299 [treeAdaptor addChild:[term1 getTree] toTree:root_0];
319 root_0 = (CommonTree *)[treeAdaptor becomeRoot:char_literal2_tree old:root_0];
330 [treeAdaptor addChild:[term3 getTree] toTree:root_0];
351 retval.tree = (CommonTree *)[treeAdaptor rulePostProcessing:root_0];
385 CommonTree *root_0 = nil;
488 retval.tree = root_0;
494 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
515 [treeAdaptor addChild:root_1 toTree:root_0];
[all …]
|
| D | PolyDifferentiator.m | 206 CommonTree *root_0 = nil;
331 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
378 [treeAdaptor addChild:root_1 toTree:root_0];
419 [treeAdaptor addChild:root_1 toTree:root_0];
431 retval.tree = root_0;
437 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
444 toTree:root_0];
449 retval.tree = root_0;
513 [treeAdaptor addChild:root_1 toTree:root_0];
532 retval.tree = root_0;
[all …]
|
| D | Simplifier.m | 435 CommonTree *root_0 = nil;
590 [treeAdaptor addChild:root_1 toTree:root_0];
604 retval.tree = root_0;
610 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
616 toTree:root_0];
621 retval.tree = root_0;
692 [treeAdaptor addChild:root_1 toTree:root_0];
706 retval.tree = root_0;
715 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
732 [treeAdaptor addChild:root_1 toTree:root_0];
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Python3/ |
| D | ASTParser.stg | 63 self._adaptor.addChild(root_0, <label>_tree)
75 root_0 = self._adaptor.becomeRoot(<label>_tree, root_0)
111 <super.matchSet(postmatchCode={<finishedBacktracking({self._adaptor.addChild(root_0, <createNodeFro…
127 …Set(postmatchCode={<finishedBacktracking({root_0 = self._adaptor.becomeRoot(<createNodeFromToken(.…
135 <finishedBacktracking({self._adaptor.addChild(root_0, <label>.tree)})>
144 <finishedBacktracking({root_0 = self._adaptor.becomeRoot(<label>.tree, root_0)})>
171 self._adaptor.addChild(root_0, <label>_tree)
181 root_0 = self._adaptor.becomeRoot(<label>_tree, root_0)
196 retval.tree = self._adaptor.rulePostProcessing(root_0)
|
| D | AST.stg | 76 root_0 = None<\n>
100 root_0 = self._adaptor.nil()<\n>
180 <prevRuleRootRef()>.tree = root_0
182 root_0 = self._adaptor.nil()
190 <prevRuleRootRef()>.tree = self._adaptor.rulePostProcessing(root_0)
202 <prevRuleRootRef()>.tree = root_0<\n>
205 <prevRuleRootRef()>.tree = root_0<\n>
310 rewriteEmptyAlt() ::= "root_0 = None"
366 root_0 = <action><\n>
371 * variable 'tree' sitting in retval struct to hold the value of root_0 right
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| D | ASTParser.stg | 63 self._adaptor.addChild(root_0, <label>_tree)
75 root_0 = self._adaptor.becomeRoot(<label>_tree, root_0)
111 <super.matchSet(postmatchCode={<finishedBacktracking({self._adaptor.addChild(root_0, <createNodeFro…
127 …Set(postmatchCode={<finishedBacktracking({root_0 = self._adaptor.becomeRoot(<createNodeFromToken(.…
135 <finishedBacktracking({self._adaptor.addChild(root_0, <label>.tree)})>
144 <finishedBacktracking({root_0 = self._adaptor.becomeRoot(<label>.tree, root_0)})>
171 self._adaptor.addChild(root_0, <label>_tree)
181 root_0 = self._adaptor.becomeRoot(<label>_tree, root_0)
196 retval.tree = self._adaptor.rulePostProcessing(root_0)
|
| D | AST.stg | 76 root_0 = None<\n>
100 root_0 = self._adaptor.nil()<\n>
180 <prevRuleRootRef()>.tree = root_0
182 root_0 = self._adaptor.nil()
190 <prevRuleRootRef()>.tree = self._adaptor.rulePostProcessing(root_0)
202 <prevRuleRootRef()>.tree = root_0<\n>
205 <prevRuleRootRef()>.tree = root_0<\n>
310 rewriteEmptyAlt() ::= "root_0 = None"
366 root_0 = <action><\n>
371 * variable 'tree' sitting in retval struct to hold the value of root_0 right
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| D | ASTParser.stg | 53 adaptor.addChild(root_0, <label>_tree);
65 root_0 = <ASTLabelType>(adaptor.becomeRoot(<label>_tree, root_0));
101 …king)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <createNodeFromTo…
117 …s.(actionScope).synpredgate> ) <endif>root_0 = <ASTLabelType>(adaptor.becomeRoot(<createNodeFromTo…
125 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <label…
134 …<actions.(actionScope).synpredgate> ) <endif>root_0 = <ASTLabelType>(adaptor.becomeRoot(<label>.tr…
161 adaptor.addChild(root_0, <label>_tree);
171 root_0 = <ASTLabelType>(adaptor.becomeRoot(<label>_tree, root_0));
186 retval.tree = <ASTLabelType>(adaptor.rulePostProcessing(root_0));
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| D | ASTParser.stg | 55 ADAPTOR->addChild(ADAPTOR, root_0, <label>_tree);
67 root_0 = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, <label>_tree, root_0));
105 … <actions.(actionScope).synpredgate> ) <endif>ADAPTOR->addChild(ADAPTOR, root_0, <createNodeFromTo…
121 …ionScope).synpredgate> ) <endif>root_0 = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, <createNode…
129 …if ( <actions.(actionScope).synpredgate> ) <endif>ADAPTOR->addChild(ADAPTOR, root_0, <label>.tree);
138 …ns.(actionScope).synpredgate> ) <endif>root_0 = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, <lab…
165 ADAPTOR->addChild(ADAPTOR, root_0, <label>_tree);
175 root_0 = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, <label>_tree, root_0));
196 retval.tree = (<ASTLabelType>)(ADAPTOR->rulePostProcessing(ADAPTOR, root_0));
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| D | ASTParser.stg | 56 adaptor.AddChild(root_0, <label>_tree);
68 root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
104 …acking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <createNodeFromTo…
120 …s.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<createNodeFromTo…
128 <if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <label>.…
137 …<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tr…
164 adaptor.AddChild(root_0, <label>_tree);
174 root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
189 retval.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| D | ASTParser.stg | 54 [treeAdaptor addChild:<label>_tree toTree:root_0];
67 root_0 = (<ASTLabelType> *)[treeAdaptor becomeRoot:<label>_tree old:root_0];
108 [treeAdaptor addChild:<createNodeFromToken(...)> toTree:root_0 ];}, ...)>
127 root_0 = (<ASTLabelType> *)[treeAdaptor becomeRoot:<createNodeFromToken(...)> old:root_0];}, ...)>
137 [treeAdaptor addChild:[<label> getTree] toTree:root_0];
148 root_0 = (<ASTLabelType> *)[treeAdaptor becomeRoot:[<label> getTree] old:root_0];
178 [treeAdaptor addChild:[[treeAdaptor create:<label>] retain] toTree:root_0];
189 root_0 = (<ASTLabelType> *)[treeAdaptor becomeRoot:<label>_tree old:root_0];
207 retval.tree = (<ASTLabelType> *)[treeAdaptor rulePostProcessing:root_0];
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| D | ASTParser.stg | 54 adaptor.addChild(root_0, <label>_tree);
68 root_0 = (<ASTLabelType>)adaptor.becomeRoot(<label>_tree, root_0);
105 …king)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <createNodeFromTo…
121 ….(actionScope).synpredgate> ) <endif>root_0 = (<ASTLabelType>)adaptor.becomeRoot(<createNodeFromTo…
130 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <label…
140 …tions.(actionScope).synpredgate> ) <endif>root_0 = (<ASTLabelType>)adaptor.becomeRoot(<label>.getT…
168 adaptor.addChild(root_0, <label>_tree);
180 root_0 = (<ASTLabelType>)adaptor.becomeRoot(<label>_tree, root_0);
196 retval.tree = (<ASTLabelType>)adaptor.rulePostProcessing(root_0);
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| D | ASTParser.stg | 58 <\n>adaptor.AddChild(root_0, <label>_tree);
72 <\n>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
109 …acking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <createNodeFromTo…
125 …s.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<createNodeFromTo…
134 <\n><if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <lab…
144 …<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tr…
172 adaptor.AddChild(root_0, <label>_tree);
184 root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
200 retval.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
|
| /external/antlr/runtime/ObjC/Framework/examples/treeparser/ |
| D | LangParser.m | 245 CommonTree *root_0 = nil;
257 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
269 [treeAdaptor addChild:[decl1 getTree] toTree:root_0];
280 retval.tree = (CommonTree *)[treeAdaptor rulePostProcessing:root_0];
314 CommonTree *root_0 = nil;
362 retval.tree = root_0;
368 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
386 [treeAdaptor addChild:root_1 toTree:root_0];
392 retval.tree = root_0;
407 retval.tree = (CommonTree *)[treeAdaptor rulePostProcessing:root_0];
[all …]
|
| /external/antlr/runtime/ObjC/Framework/examples/treerewrite/ |
| D | TreeRewriteParser.m | 204 CommonTree *root_0 = nil;
243 retval.tree = root_0;
249 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
263 [treeAdaptor addChild:root_1 toTree:root_0];
269 retval.tree = root_0;
283 retval.tree = (CommonTree *)[treeAdaptor rulePostProcessing:root_0];
317 CommonTree *root_0 = nil;
329 root_0 = (CommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
338 [treeAdaptor addChild:INT3_tree toTree:root_0];
350 retval.tree = (CommonTree *)[treeAdaptor rulePostProcessing:root_0];
|
| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestTrees.java | 60 CommonTree root_0 = (CommonTree)adaptor.nil(); in testTwoChildrenOfNilRoot() local
63 adaptor.addChild(root_0, t); in testTwoChildrenOfNilRoot()
64 adaptor.addChild(root_0, u); in testTwoChildrenOfNilRoot()
65 assertNull(root_0.parent); in testTwoChildrenOfNilRoot()
66 assertEquals(-1, root_0.childIndex); in testTwoChildrenOfNilRoot()
228 CommonTree root_0 = (CommonTree)adaptor.nil(); in testBecomeRoot6() local
234 adaptor.addChild(root_0, root_1); in testBecomeRoot6()
236 root_0.sanityCheckParentAndChildIndexes(); in testBecomeRoot6()
|