| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tree.Tests.pas | 254 Adaptor: ITreeAdaptor;
262 Adaptor := TCommonTreeAdaptor.Create;
263 Adaptor.BecomeRoot(NewRoot, OldRoot);
270 Adaptor: ITreeAdaptor;
277 Adaptor := TCommonTreeAdaptor.Create;
278 Adaptor.BecomeRoot(NewRoot, OldRoot);
285 Adaptor: ITreeAdaptor;
294 Adaptor := TCommonTreeAdaptor.Create;
295 Adaptor.BecomeRoot(NewRoot, OldRoot);
302 Adaptor: ITreeAdaptor
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| BufferedTreeNodeStream.java | 105 /** What tree adaptor was used to build these trees */
106 TreeAdaptor adaptor; field in class:BufferedTreeNodeStream
126 public BufferedTreeNodeStream(TreeAdaptor adaptor, Object tree) {
127 this(adaptor, tree, DEFAULT_INITIAL_BUFFER_SIZE);
130 public BufferedTreeNodeStream(TreeAdaptor adaptor, Object tree, int initialBufferSize) {
132 this.adaptor = adaptor;
134 down = adaptor.create(Token.DOWN, "DOWN");
135 up = adaptor.create(Token.UP, "UP");
136 eof = adaptor.create(Token.EOF, "EOF")
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| AST.stg | 52 /** Add an adaptor property that knows how to build trees */
57 property Adaptor: ITreeAdaptor read FAdaptor;
111 <ruleDescriptor.allTokenRefsInAltsWithRewrites:{Locals['Stream_<it>'] := TRewriteRule<rewriteElementType>Stream.Create(Adaptor,'token <it>');}; separator="\n">
112 <ruleDescriptor.allRuleRefsInAltsWithRewrites:{Locals['Stream_<it>'] := TRewriteRuleSubtreeStream.Create(Adaptor,'rule <it>');}; separator="\n">
129 Root[0] := Adaptor.GetNilNode as I<ASTLabelType>;
217 Root[0] := Adaptor.GetNilNode as I<ASTLabelType>;
222 <prevRuleRootRef()>.Tree = (<ASTLabelType>)adaptor.rulePostProcessing(root[0]);
223 input.ReplaceChildren(adaptor.GetParent(retval.Start),
224 adaptor.GetChildIndex(retval.Start),
225 adaptor.GetChildIndex(_last)
[all...] |
| ASTParser.stg | 46 RetVal.Tree := Adaptor.ErrorNode(Input, RetVal.Start as IToken,
60 Adaptor.AddChild(Root[0], <label>_tree);
77 Root[0] := Adaptor.BecomeRoot(<label>_tree, Root[0]) as I<ASTLabelType>;
115 <super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <createNodeFromToken(...)>);})>
131 <super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<createNodeFromToken(...)>, Root[0]) as I<ASTLabelType>;})>
139 <if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <label>.Tree);
148 <if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<label>.Tree, Root[0]) as I<ASTLabelType>;
177 <label>_tree := Adaptor.CreateNode(<label>) as I<ASTLabelType>;
178 Adaptor.AddChild(Root[0], <label>_tree);
192 <label>_tree := Adaptor.CreateNode(<label>) as I<ASTLabelType>
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| DotTreeGenerator.cs | 95 public virtual string ToDot( object tree, ITreeAdaptor adaptor )
102 var nodes = DefineNodes( tree, adaptor );
104 var edges = DefineEdges( tree, adaptor );
124 protected virtual IEnumerable<string> DefineNodes( object tree, ITreeAdaptor adaptor )
129 int n = adaptor.GetChildCount( tree );
138 yield return GetNodeText( adaptor, tree );
143 object child = adaptor.GetChild( tree, i );
144 yield return GetNodeText( adaptor, child );
145 foreach ( var t in DefineNodes( child, adaptor ) )
150 protected virtual IEnumerable<string> DefineEdges( object tree, ITreeAdaptor adaptor )
[all...] |
| BufferedTreeNodeStream.cs | 136 /** <summary>What tree adaptor was used to build these trees</summary> */
137 ITreeAdaptor adaptor; field in class:Antlr.Runtime.Tree.BufferedTreeNodeStream
157 public BufferedTreeNodeStream(ITreeAdaptor adaptor, object tree)
158 : this(adaptor, tree, DEFAULT_INITIAL_BUFFER_SIZE) {
161 public BufferedTreeNodeStream(ITreeAdaptor adaptor, object tree, int initialBufferSize) {
163 this.adaptor = adaptor;
165 down = adaptor.Create(TokenTypes.Down, "DOWN");
166 up = adaptor.Create(TokenTypes.Up, "UP");
167 eof = adaptor.Create(TokenTypes.EndOfFile, "EOF")
[all...] |
| TreeVisitor.cs | 38 protected ITreeAdaptor adaptor; field in class:Antlr.Runtime.Tree.TreeVisitor
40 public TreeVisitor(ITreeAdaptor adaptor)
42 this.adaptor = adaptor;
61 bool isNil = adaptor.IsNil(t);
66 for (int i = 0; i < adaptor.GetChildCount(t); i++)
68 object child = adaptor.GetChild(t, i);
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Utility/Antlr.Utility.Tree/ |
| DOTTreeGenerator.cs | 93 public virtual string ToDot(object tree, ITreeAdaptor adaptor) {
99 var nodes = DefineNodes(tree, adaptor);
101 var edges = DefineEdges(tree, adaptor);
120 protected virtual IEnumerable<string> DefineNodes(object tree, ITreeAdaptor adaptor) {
124 int n = adaptor.GetChildCount(tree);
132 yield return GetNodeText(adaptor, tree);
136 object child = adaptor.GetChild(tree, i);
137 yield return GetNodeText(adaptor, child);
138 foreach (var t in DefineNodes(child, adaptor))
143 protected virtual IEnumerable<string> DefineEdges(object tree, ITreeAdaptor adaptor) {
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| DotTreeGenerator.cs | 95 public virtual string ToDot( object tree, ITreeAdaptor adaptor )
102 var nodes = DefineNodes( tree, adaptor );
104 var edges = DefineEdges( tree, adaptor );
124 protected virtual IEnumerable<string> DefineNodes( object tree, ITreeAdaptor adaptor )
129 int n = adaptor.GetChildCount( tree );
138 yield return GetNodeText( adaptor, tree );
143 object child = adaptor.GetChild( tree, i );
144 yield return GetNodeText( adaptor, child );
145 foreach ( var t in DefineNodes( child, adaptor ) )
150 protected virtual IEnumerable<string> DefineEdges( object tree, ITreeAdaptor adaptor )
[all...] |
| BufferedTreeNodeStream.cs | 145 /** <summary>What tree adaptor was used to build these trees</summary> */
146 ITreeAdaptor adaptor; field in class:Antlr.Runtime.Tree.BufferedTreeNodeStream
167 public BufferedTreeNodeStream( ITreeAdaptor adaptor, object tree )
168 : this( adaptor, tree, DEFAULT_INITIAL_BUFFER_SIZE )
172 public BufferedTreeNodeStream( ITreeAdaptor adaptor, object tree, int initialBufferSize )
175 this.adaptor = adaptor;
177 down = adaptor.Create( TokenTypes.Down, "DOWN" );
178 up = adaptor.Create( TokenTypes.Up, "UP" );
179 eof = adaptor.Create( TokenTypes.EndOfFile, "EOF" )
[all...] |
| TreeVisitor.cs | 40 protected ITreeAdaptor adaptor; field in class:Antlr.Runtime.Tree.TreeVisitor
42 public TreeVisitor( ITreeAdaptor adaptor )
44 this.adaptor = adaptor;
63 bool isNil = adaptor.IsNil( t );
68 for ( int i = 0; i < adaptor.GetChildCount(t); i++ )
70 object child = adaptor.GetChild( t, i );
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
| ASTTreeParser.stg | 28 if ( this.adaptor.getParent(retval.tree) && this.adaptor.isNil( this.adaptor.getParent(retval.tree) ) )
29 retval.tree = this.adaptor.getParent(retval.tree);
44 var root_<treeLevel> = this.adaptor.nil();
68 this.adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>);
93 <label>_tree = this.adaptor.dupNode(<label>);
95 this.adaptor.addChild(root_<treeLevel>, <label>_tree);
118 <label>_tree = this.adaptor.dupNode(<label>);
120 root_<treeLevel> = this.adaptor.becomeRoot(<label>_tree, root_<treeLevel>)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
| ASTTreeParser.stg | 57 if ( adaptor.getParent(retval.tree)!=null && adaptor.isNil( adaptor.getParent(retval.tree) ) )
58 retval.tree = (<ASTLabelType>)adaptor.getParent(retval.tree);
73 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.nil();
97 adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>);
122 <label>_tree = (<ASTLabelType>)adaptor.dupNode(<label>);
124 adaptor.addChild(root_<treeLevel>, <label>_tree);
147 <label>_tree = (<ASTLabelType>)adaptor.dupNode(<label>);
149 root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(<label>_tree, root_<treeLevel>)
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| CommonTreeNodeStream.as | 78 /** What tree adaptor was used to build these trees */
79 internal var adaptor:TreeAdaptor;
95 public function CommonTreeNodeStream(tree:Object, adaptor:TreeAdaptor = null, initialBufferSize:int = DEFAULT_INITIAL_BUFFER_SIZE) {
101 this.adaptor = adaptor == null ? new CommonTreeAdaptor() : adaptor;
104 down = this.adaptor.createFromType(TokenConstants.DOWN, "DOWN");
105 up = this.adaptor.createFromType(TokenConstants.UP, "UP");
106 eof = this.adaptor.createFromType(TokenConstants.EOF, "EOF");
117 stream.adaptor = parent.adaptor
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleNodeStream.js | 4 org.antlr.runtime.tree.RewriteRuleNodeStream = function(adaptor, elementDescription, el) {
16 return this.adaptor.dupNode(el);
|
| RewriteRuleTokenStream.js | 1 org.antlr.runtime.tree.RewriteRuleTokenStream = function(adaptor, elementDescription, el) {
11 return this.adaptor.create(t);
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/ |
| record-event-listener.rb | 14 def initialize( adaptor = nil )
|
| socket.rb | 27 @adaptor = options[ :adaptor ]
188 def adaptor method in class:ANTLR3.Debug.EventSocketProxy
189 @adaptor ||= ANTLR3::CommonTreeAdaptor.new
197 transmit "%s\t%i", :flat_node, adaptor.unique_id( tree )
201 transmit "%s\t%i\t%i\t%p", :error_node, adaptor.unique_id( tree ),
207 transmit "%s\t%i\t%i", :create_node, adaptor.unique_id( node ),
210 transmit "%s\t%i\t%i\t%p", :create_node, adaptor.unique_id( node ),
211 adaptor.type_of( node ), adaptor.text_of( node
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| testdottreegen.py | 19 self.adaptor = CommonTreeAdaptor()
23 self.wiz = TreeWizard(self.adaptor, self.tokens)
42 st = toDOT(tree, self.adaptor, treeST, edgeST)
|
| testtree.py | 16 self.adaptor = CommonTreeAdaptor()
58 root_0 = self.adaptor.nil();
61 self.adaptor.addChild(root_0, t)
62 self.adaptor.addChild(root_0, u)
554 self.adaptor = CommonTreeAdaptor()
661 dup = self.adaptor.dupTree(r0)
677 self.adaptor.becomeRoot(newRoot, oldRoot)
689 self.adaptor.becomeRoot(newRoot, oldRoot)
703 self.adaptor.becomeRoot(newRoot, oldRoot)
716 self.adaptor.becomeRoot(newRoot, oldRoot
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.adapt/rand.adapt.shuf/ |
| ctor_engine_copy.pass.cpp | 24 typedef std::knuth_b Adaptor;
26 Adaptor a(e);
27 for (unsigned k = 0; k <= Adaptor::table_size; ++k)
|
| ctor_engine_move.pass.cpp | 24 typedef std::knuth_b Adaptor;
27 Adaptor a(std::move(e0));
28 for (unsigned k = 0; k <= Adaptor::table_size; ++k)
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| ASTParser.stg | 43 retval.tree = <ASTLabelType>(adaptor.errorNode(input, Token(retval.start), input.LT(-1), re));
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));
161 <label>_tree = <ASTLabelType>(adaptor.create(<label>));
162 adaptor.addChild(root_0, <label>_tree);
171 <label>_tree = <ASTLabelType>(adaptor.create(<label>))
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| ASTParser.stg | 45 retval.Tree = (<ASTLabelType>)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
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);
163 <label>_tree = (<ASTLabelType>)adaptor.Create(<label>);
164 adaptor.AddChild(root_0, <label>_tree);
173 <label>_tree = (<ASTLabelType>)adaptor.Create(<label>)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| ASTParser.stg | 46 retval.Tree = (<ASTLabelType>)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
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);
171 <label>_tree = (<ASTLabelType>)adaptor.Create(<label>);
172 adaptor.AddChild(root_0, <label>_tree);
183 <label>_tree = (<ASTLabelType>)adaptor.Create(<label>)
[all...] |
