| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| ASTParser.stg | 54 adaptor.addChild(root_0, <label>_tree);
66 root_0 = <ASTLabelType>(adaptor.becomeRoot(<label>_tree, root_0));
102 <super.matchSet(..., postmatchCode={<if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <createNodeFromToken(...)>);})>
118 <super.matchSet(..., postmatchCode={<if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = <ASTLabelType>(adaptor.becomeRoot(<createNodeFromToken(...)>, root_0));})>
126 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <label>.tree);
135 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = <ASTLabelType>(adaptor.becomeRoot(<label>.tree, root_0));
162 adaptor.addChild(root_0, <label>_tree)
[all...] |
| AST.stg | 62 var root_0:<ASTLabelType> = null;<\n>
85 root_0 = <ASTLabelType>(adaptor.nil());<\n>
166 <prevRuleRootRef()>.tree = root_0;
168 root_0 = <ASTLabelType>(adaptor.nil());
173 <prevRuleRootRef()>.tree = <ASTLabelType>(adaptor.rulePostProcessing(root_0));
182 <prevRuleRootRef()>.tree = root_0;
185 <prevRuleRootRef()>.tree = root_0;
278 rewriteEmptyAlt() ::= "root_0 = null;"
335 root_0 = <action>;<\n>
340 * variable 'tree' sitting in retval struct to hold the value of root_0 righ
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| ASTParser.stg | 53 adaptor.addChild(root_0, <label>_tree);
65 root_0 = (<ASTLabelType>)adaptor.becomeRoot(<label>_tree, root_0);
101 <super.matchSet(postmatchCode={<if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <createNodeFromToken(...)>);}, ...)>
117 <super.matchSet(postmatchCode={<if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = (<ASTLabelType>)adaptor.becomeRoot(<createNodeFromToken(...)>, root_0);},...)>
125 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <label>.getTree());
134 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = (<ASTLabelType>)adaptor.becomeRoot(<label>.getTree(), root_0);
161 adaptor.addChild(root_0, <label>_tree)
[all...] |
| AST.stg | 61 <ASTLabelType> root_0 = null;<\n>
84 root_0 = (<ASTLabelType>)adaptor.nil();<\n>
166 <prevRuleRootRef()>.tree = root_0;
168 root_0 = (<ASTLabelType>)adaptor.nil();
173 <prevRuleRootRef()>.tree = (<ASTLabelType>)adaptor.rulePostProcessing(root_0);
182 <prevRuleRootRef()>.tree = root_0;
185 <prevRuleRootRef()>.tree = root_0;
278 rewriteEmptyAlt() ::= "root_0 = null;"
335 root_0 = <action>;<\n>
340 * variable 'tree' sitting in retval struct to hold the value of root_0 righ
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
| ASTParser.stg | 25 this.adaptor.addChild(root_0, <label>_tree);
37 root_0 = this.adaptor.becomeRoot(<label>_tree, root_0);
73 <super.matchSet(..., postmatchCode={<if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>this.adaptor.addChild(root_0, <createNodeFromToken(...)>);})>
89 <super.matchSet(..., postmatchCode={<if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = this.adaptor.becomeRoot(<createNodeFromToken(...)>, root_0);})>
97 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>this.adaptor.addChild(root_0, <label>.getTree());
106 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = this.adaptor.becomeRoot(<label>.getTree(), root_0);
133 this.adaptor.addChild(root_0, <label>_tree)
[all...] |
| 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 righ
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| ASTParser.stg | 61 self._adaptor.addChild(root_0, <label>_tree)
73 root_0 = self._adaptor.becomeRoot(<label>_tree, root_0)
109 <super.matchSet(postmatchCode={<finishedBacktracking({self._adaptor.addChild(root_0, <createNodeFromToken(...)>)})>}, ...)>
125 <super.matchSet(postmatchCode={<finishedBacktracking({root_0 = self._adaptor.becomeRoot(<createNodeFromToken(...)>, root_0)})>}, ...)>
133 <finishedBacktracking({self._adaptor.addChild(root_0, <label>.tree)})>
142 <finishedBacktracking({root_0 = self._adaptor.becomeRoot(<label>.tree, root_0)})>
169 self._adaptor.addChild(root_0, <label>_tree
[all...] |
| 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 righ
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| ASTParser.stg | 55 ADAPTOR->addChild(ADAPTOR, root_0, <label>_tree);
67 root_0 = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, <label>_tree, root_0));
105 <super.matchSet(postmatchCode={<if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>ADAPTOR->addChild(ADAPTOR, root_0, <createNodeFromToken(...)>);},...)>
121 <super.matchSet(postmatchCode={<if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, <createNodeFromToken(...)>, root_0));},...)>
129 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>ADAPTOR->addChild(ADAPTOR, root_0, <label>.tree);
138 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, <label>.tree, root_0));
165 ADAPTOR->addChild(ADAPTOR, root_0, <label>_tree)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| ASTParser.stg | 56 adaptor.AddChild(root_0, <label>_tree);
68 root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
104 <super.matchSet(postmatchCode={<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <createNodeFromToken(...)>);}, ...)>
120 <super.matchSet(postmatchCode={<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<createNodeFromToken(...)>, root_0);}, ...)>
128 <if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <label>.Tree);
137 <if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tree, root_0);
164 adaptor.AddChild(root_0, <label>_tree)
[all...] |
| AST.stg | 88 <ASTLabelType> root_0 = default(<ASTLabelType>);<\n>
111 root_0 = (<ASTLabelType>)adaptor.Nil();
192 <prevRuleRootRef()>.Tree = root_0;
194 root_0 = (<ASTLabelType>)adaptor.Nil();
198 <prevRuleRootRef()>.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
206 <prevRuleRootRef()>.Tree = root_0;
305 rewriteEmptyAlt() ::= "root_0 = null;"
363 root_0 = <action>;<\n>
368 * variable 'tree' sitting in retval struct to hold the value of root_0 right
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| ASTParser.stg | 58 <\n>adaptor.AddChild(root_0, <label>_tree);
72 <\n>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
109 <super.matchSet(postmatchCode={<if(!ruleDescriptor.isSynPred)><if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <createNodeFromToken(...)>);<endif>}, ...)>
125 <super.matchSet(postmatchCode={<if(!ruleDescriptor.isSynPred)><if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<createNodeFromToken(...)>, root_0);<endif>}, ...)>
134 <\n><if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <label>.Tree);
144 <if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tree, root_0);
172 adaptor.AddChild(root_0, <label>_tree)
[all...] |
| AST.stg | 88 <ASTLabelType> root_0 = default(<ASTLabelType>);<\n>
111 root_0 = (<ASTLabelType>)adaptor.Nil();
190 <prevRuleRootRef()>.Tree = root_0;
192 root_0 = (<ASTLabelType>)adaptor.Nil();
196 <prevRuleRootRef()>.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
204 <prevRuleRootRef()>.Tree = root_0;
303 rewriteEmptyAlt() ::= "root_0 = null;"
361 root_0 = <action>;<\n>
366 * variable 'tree' sitting in retval struct to hold the value of root_0 right
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| 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 createTree:<label>] retain] toTree:root_0];
[all...] |
| AST.stg | 168 <ASTLabelType> *root_0 = nil;<\n>
193 [<prevRuleRootRef()> setTree:(<ASTLabelType> *)[treeAdaptor rulePostProcessing:root_0]];<\n>
200 [root_0 release];
221 root_0 = (<ASTLabelType> *)[[[treeAdaptor class] newEmptyTree] retain];<\n>
312 <prevRuleRootRef()>.tree = root_0;<\n>
314 root_0 = (<ASTLabelType> *)[[[treeAdaptor class] newEmptyTree] retain];<\n>
319 <prevRuleRootRef()>.tree = (<ASTLabelType>)[treeAdaptor rulePostProcessing:root_0];
328 <prevRuleRootRef()>.tree = root_0;<\n>
331 <prevRuleRootRef()>.tree = root_0;<\n>
433 rewriteEmptyAlt() ::= "root_0 = nil;
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| SimpleCParser.java | 76 Object root_0 = null; local
86 root_0 = (Object)adaptor.nil();
109 adaptor.addChild(root_0, declaration1.getTree());
128 retval.tree = (Object)adaptor.rulePostProcessing(root_0);
155 Object root_0 = null; local
179 root_0 = (Object)adaptor.nil();
186 adaptor.addChild(root_0, variable2.getTree());
211 retval.tree = root_0;
214 root_0 = (Object)adaptor.nil();
224 adaptor.addChild(root_0, root_1)
309 Object root_0 = null; local
400 Object root_0 = null; local
448 Object root_0 = null; local
614 Object root_0 = null; local
699 Object root_0 = null; local
754 Object root_0 = null; local
918 Object root_0 = null; local
1085 Object root_0 = null; local
1220 Object root_0 = null; local
1308 Object root_0 = null; local
1358 Object root_0 = null; local
1477 Object root_0 = null; local
1565 Object root_0 = null; local
[all...] |
| SimpleCParser.m | [all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
| SimpleCParser.java | 76 Object root_0 = null; local
86 root_0 = (Object)adaptor.nil();
109 adaptor.addChild(root_0, declaration1.getTree());
128 retval.tree = (Object)adaptor.rulePostProcessing(root_0);
155 Object root_0 = null; local
179 root_0 = (Object)adaptor.nil();
186 adaptor.addChild(root_0, variable2.getTree());
211 retval.tree = root_0;
214 root_0 = (Object)adaptor.nil();
224 adaptor.addChild(root_0, root_1)
309 Object root_0 = null; local
400 Object root_0 = null; local
448 Object root_0 = null; local
614 Object root_0 = null; local
699 Object root_0 = null; local
754 Object root_0 = null; local
918 Object root_0 = null; local
1085 Object root_0 = null; local
1220 Object root_0 = null; local
1308 Object root_0 = null; local
1358 Object root_0 = null; local
1477 Object root_0 = null; local
1565 Object root_0 = null; local
[all...] |
| SimpleCParser.m | [all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/output1/ |
| TreeRewriteParser.m | 211 ANTLRCommonTree *root_0 = nil;
247 [retval setTree:root_0];
249 retval.tree = root_0;
256 root_0 = (ANTLRCommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
269 [treeAdaptor addChild:root_1 toTree:root_0];
274 retval.tree = root_0;
284 retval.tree = (ANTLRCommonTree *)[treeAdaptor rulePostProcessing:root_0];
310 ANTLRCommonTree *root_0 = nil;
321 root_0 = (ANTLRCommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
325 [treeAdaptor addChild:INT3_tree toTree:root_0];
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
| LangParser.m | 262 ANTLRCommonTree *root_0 = nil;
273 root_0 = (ANTLRCommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
284 [treeAdaptor addChild:[decl1 getTree] toTree:root_0];
295 retval.tree = (ANTLRCommonTree *)[treeAdaptor rulePostProcessing:root_0];
329 ANTLRCommonTree *root_0 = nil;
376 retval.tree = root_0;
382 root_0 = (ANTLRCommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
400 [treeAdaptor addChild:root_1 toTree:root_0];
406 retval.tree = root_0;
421 retval.tree = (ANTLRCommonTree *)[treeAdaptor rulePostProcessing:root_0];
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
| TreeRewriteParser.m | 219 ANTLRCommonTree *root_0 = nil;
257 retval.tree = root_0;
263 root_0 = (ANTLRCommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
277 [treeAdaptor addChild:root_1 toTree:root_0];
283 retval.tree = root_0;
297 retval.tree = (ANTLRCommonTree *)[treeAdaptor rulePostProcessing:root_0];
331 ANTLRCommonTree *root_0 = nil;
342 root_0 = (ANTLRCommonTree *)[[[treeAdaptor class] newEmptyTree] retain];
350 [treeAdaptor addChild:INT3_tree toTree:root_0];
362 retval.tree = (ANTLRCommonTree *)[treeAdaptor rulePostProcessing:root_0];
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
| DebugGrammarParser.cs | 136 CommonTree root_0 = null;
158 root_0 = (CommonTree)adaptor.Nil();
200 adaptor.AddChild(root_0, stat1.Tree);
224 retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
268 CommonTree root_0 = null;
353 retval.tree = root_0;
356 root_0 = (CommonTree)adaptor.Nil();
360 adaptor.AddChild(root_0, stream_expr.NextTree());
364 retval.tree = root_0;
403 retval.tree = root_0;
[all...] |
| ProfileGrammarParser.cs | 140 CommonTree root_0 = null;
162 root_0 = (CommonTree)adaptor.Nil();
204 adaptor.AddChild(root_0, stat1.Tree);
228 retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
272 CommonTree root_0 = null;
357 retval.tree = root_0;
360 root_0 = (CommonTree)adaptor.Nil();
364 adaptor.AddChild(root_0, stream_expr.NextTree());
368 retval.tree = root_0;
407 retval.tree = root_0;
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTrees.java | 57 CommonTree root_0 = (CommonTree)adaptor.nil(); local
60 adaptor.addChild(root_0, t);
61 adaptor.addChild(root_0, u);
62 assertNull(root_0.parent);
63 assertEquals(-1, root_0.childIndex);
225 CommonTree root_0 = (CommonTree)adaptor.nil(); local
231 adaptor.addChild(root_0, root_1);
233 root_0.sanityCheckParentAndChildIndexes();
|
