/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | TreeFilter.java | 28 package org.antlr.runtime.tree; 38 Now, how are we going to test these tree patterns against every 39 subtree in our original tree? In what order should we visit nodes? 41 rule application strategy and a ``down then up'' tree traversal 45 a pattern matches, we execute the associated tree rewrite and move on 49 TreeParser (derived from a tree grammar) to a tree: 54 tree parser class (@cl Simplify in this case). Most of the time, the 55 rule will not match the tree. To avoid issuing syntax errors and 59 the details. This method boils down to ``call a rule to match a tree, [all...] |
H A D | ParseTree.java | 28 package org.antlr.runtime.tree; 35 * end up as the leaves of this tree and rule nodes are the interior nodes. 100 /** Print out the leaves of this tree, which means printing original
|
H A D | RewriteRuleElementStream.java | 28 package org.antlr.runtime.tree; 41 * @see org.antlr.runtime.tree.RewriteRuleSubtreeStream 42 * @see org.antlr.runtime.tree.RewriteRuleTokenStream 149 * a tree node or subtree. Deal with the optimization of single- 180 * the element is for a tree root; then it must be a node dup.
|
H A D | TreeNodeStream.java | 28 package org.antlr.runtime.tree; 33 /** A stream of tree nodes, accessing nodes from a tree of some kind */ 35 /** Get a tree node at an absolute index i; 0..n-1. 41 /** Get tree node at current input pointer + i ahead where i=1 is next node. 49 * returns a tree node instead of a token. Makes code gen identical 50 * for both parser and tree grammars. :) 59 /** If the tree associated with this stream was created from a TokenStream, 60 * you can specify it here. Used to do rule $text attribute in tree 61 * parser. Optional unless you use tree parse [all...] |
H A D | TreePatternLexer.java | 28 package org.antlr.runtime.tree; 40 /** The tree pattern to lex like "(A B C)" */
|
H A D | TreeRewriter.java | 28 package org.antlr.runtime.tree; 116 // to override, just define tree grammar rule topdown and turn on
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
H A D | TreeRewriteParser.h | 38 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable 42 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable 57 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable 61 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
|
/external/antlr/antlr-3.4/runtime/Python/tests/ |
H A D | t054main.py | 6 import antlr3.tree namespace 204 r'''tree grammar T6Walker; 245 r'''tree grammar T7Walker;
|
H A D | t049treeparser.py | 4 import antlr3.tree namespace 44 nodes = antlr3.tree.CommonTreeNodeStream(r.tree) 66 r'''tree grammar TP; 100 r'''tree grammar TP; 135 r'''tree grammar TP; 170 r'''tree grammar TP; 205 r'''tree grammar TP; 233 ## "tree grammar TP;\n" + 259 r'''tree gramma [all...] |
H A D | t052import.py | 4 import antlr3.tree namespace 878 # "tree grammar M;\n" + 895 # "error(161): "+tmpdir.toString().replaceFirst("\\-[0-9]+","")+"/M.g:2:8: tree grammar M cannot import lexer grammar S";
|
H A D | t055templates.py | 4 import antlr3.tree namespace 435 r'''tree grammar T6Walker; 484 tree = parser.prog().tree 485 nodes = antlr3.tree.CommonTreeNodeStream(tree)
|
/external/chromium_org/third_party/WebKit/Source/core/frame/ |
H A D | Frame.h | 82 FrameTree& tree() const; 134 inline FrameTree& Frame::tree() const function in class:blink::Frame
|
/external/chromium_org/third_party/libxml/src/ |
H A D | testRelax.c | 51 static int tree = 0; variable 76 if ((!strcmp(argv[i], "-tree")) || (!strcmp(argv[i], "--tree"))) { 77 tree++; 131 if (tree) 173 printf("\t--debug : dump a debug tree of the in-memory document\n"); 176 printf("\t--tree : print the intermediate Relax-NG document tree\n");
|
/external/chromium_org/ui/accessibility/ |
H A D | ax_generated_tree_unittest.cc | 17 // A function to turn a tree into a string, capturing only the node ids 26 // (1) is a tree with a single node with id 1. 27 // (1 (2 3)) is a tree with 1 as the root, and 2 and 3 as its children. 42 std::string TreeToString(const AXTree& tree) { argument 44 TreeToStringHelper(tree.GetRoot(), &result); 74 AXTree tree; local 75 generator.BuildUniqueTree(i, &tree); 76 std::string str = TreeToString(tree); 81 // Test mutating every possible tree with <n> nodes to every other possible 82 // tree wit [all...] |
/external/elfutils/0.153/libdw/ |
H A D | libdw_findcu.c | 144 void **tree = debug_types ? &dbg->tu_tree : &dbg->cu_tree; local 150 struct Dwarf_CU **found = tfind (&fake, tree, findcu_cb); 168 /* Add the new entry to the search tree. */ 169 if (tsearch (newp, tree, findcu_cb) == NULL)
|
/external/libnl/lib/route/cls/ |
H A D | cgroup.c | 97 int rtnl_cgroup_set_ematch(struct rtnl_cls *cls, struct rtnl_ematch_tree *tree) argument 106 cg->cg_ematch = tree; 108 if (tree)
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | FrameNode.java | 30 package org.mockito.asm.tree;
|
/external/smali/util/src/main/java/ds/tree/ |
H A D | RadixTreeNode.java | 25 package ds.tree; 31 * Represents a node of a Radix tree {@link RadixTreeImpl}
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
H A D | LangParser.h | 43 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable 47 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable 62 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable 66 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable 81 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable 85 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
|
/external/chromium_org/cc/layers/ |
H A D | picture_image_layer_impl_unittest.cc | 52 LayerTreeImpl* tree = NULL; local 55 tree = host_impl_.active_tree(); 58 tree = host_impl_.pending_tree(); 65 new TestablePictureImageLayerImpl(tree, id);
|
/external/chromium_org/cc/resources/ |
H A D | tile.cc | 48 void Tile::SetPriority(WhichTree tree, const TilePriority& priority) { argument 49 if (priority == priority_[tree]) 52 priority_[tree] = priority; 100 RasterMode Tile::DetermineRasterModeForTree(WhichTree tree) const { 101 return DetermineRasterModeForResolution(priority(tree).resolution);
|
/external/chromium_org/chrome/browser/ui/ash/accessibility/ |
H A D | ax_tree_source_ash_unittest.cc | 29 // Helper to count the number of nodes in a tree. 30 size_t GetSize(AXAuraObjWrapper* tree) { argument 34 tree->GetChildren(&out_children); 79 // Grab the content view directly from cache to avoid walking down the tree. 97 // Try walking up the tree to the root. 120 // Grab the textfield since serialization only walks up the tree (not down
|
/external/chromium_org/content/browser/accessibility/ |
H A D | accessibility_ipc_error_browsertest.cc | 90 const ui::AXTree* tree = nullptr; local 99 tree = &waiter.GetAXTree(); 102 // Get the accessibility tree, ensure it reflects the final state of the 104 const ui::AXNode* root = tree->GetRoot(); 107 VLOG(1) << tree->ToString();
|
/external/chromium_org/third_party/boringssl/src/crypto/x509v3/ |
H A D | pcy_node.c | 115 X509_POLICY_TREE *tree) 144 if (tree) 146 if (!tree->extra_data) 147 tree->extra_data = sk_X509_POLICY_DATA_new_null(); 148 if (!tree->extra_data) 150 if (!sk_X509_POLICY_DATA_push(tree->extra_data, data)) 112 level_add_node(X509_POLICY_LEVEL *level, const X509_POLICY_DATA *data, X509_POLICY_NODE *parent, X509_POLICY_TREE *tree) argument
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
H A D | entropy.h | 6 * tree. An additional intellectual property rights grant can be found 8 * be found in the AUTHORS file in the root of the source tree. 46 vp8_tree_p tree; member in struct:__anon13051
|