| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| tree.rb | 72 Trees (ASTs), tree structures that reflect the high-level syntactic and semantic
90 (instead of basic tokens), and adds some helper methods for working with trees.
192 = ANTLR Abstract Syntax Trees
195 wraps a token, a list of child trees, and some information about the collective
200 tree nodes as well as the methods trees need to implement.
463 application, building trees with all of this extra information may be
468 the customized lighter-weight trees.
669 trees. Using an adaptor object permits a single recognizer to work with any
671 on customized tree structures. For example, if you want to represent trees using
[all...] |
| /external/zlib/src/ |
| ChangeLog | 271 - Update trees.c to be able to generate modified trees.h
362 - Avoid use of "eof" parameter in trees.c to not shadow library variable
513 - Add ush casts in trees.c to avoid pedantic runtime errors
531 - Add Z_TREES flush option to inflate() to return at end of trees
581 trees.c, according to the txtvsbin.txt document [Truta]
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| tree.py | 103 such as CommonTreeNodeStream that work on these kinds of trees. You
104 don't have to make your trees implement this interface, but if you do,
107 NOTE: When constructing trees, ANTLR can build any kind of tree; it can
108 even use Token objects as trees if you add a child list to your tokens.
274 How to create and navigate trees. Rather than have a separate factory
288 Create a tree node from Token object; for CommonTree type trees,
399 for non-flat trees.
401 Flat trees such as for lists like "idlist : ID+ ;" are left alone
413 """For identifying trees.
493 method right before returning. Flat trees (i.e., lists) wil
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3commontree.c | 114 // that we can use later for converting trees to strings.
193 // that we can use later for converting trees to strings.
318 tree->baseTree.free = NULL; // Factory trees have no free function
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| NFAContext.java | 31 * other NFAs. These trees only have to point upwards to their parents
38 * DFA will have m NFAContext trees.
133 * Note that you may be comparing contexts in different alt trees.
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| AST.stg | 73 /* Add an adaptor property that knows how to build trees */
79 /* Add an adaptor property that knows how to build trees */
92 /* Add an adaptor property that knows how to build trees */
|
| /external/chromium_org/cc/layers/ |
| layer.h | 25 #include "cc/trees/occlusion_tracker.h"
356 // canvas that doesn't want to be triple-buffered across all three trees.
471 // updated via SetLayerTreeHost() if a layer moves between trees.
|
| scrollbar_layer_unittest.cc | 23 #include "cc/trees/layer_tree_impl.h"
24 #include "cc/trees/single_thread_proxy.h"
25 #include "cc/trees/tree_synchronizer.h"
|
| scrollbar_layer_impl.cc | 14 #include "cc/trees/layer_tree_impl.h"
15 #include "cc/trees/layer_tree_settings.h"
|
| /external/chromium_org/cc/trees/ |
| damage_tracker.cc | 5 #include "cc/trees/damage_tracker.h"
14 #include "cc/trees/layer_tree_host_common.h"
15 #include "cc/trees/layer_tree_impl.h"
|
| layer_tree_impl.cc | 5 #include "cc/trees/layer_tree_impl.h"
14 #include "cc/trees/layer_tree_host_common.h"
15 #include "cc/trees/layer_tree_host_impl.h"
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/ |
| buildpkb.sh | 216 ##### DECISION TREES ####################
324 ##### DECISION TREES ####################
456 ##### DECISION TREES ####################
|
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
288 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarSanity.java | 257 * use -> on alts that are simple nodes or trees or single rule refs
258 * that match either nodes or trees. The altAST is the ALT node
|
| /external/blktrace/btt/ |
| args.c | 125 .name = "per-io-trees",
223 "[ -P <output name> | --per-io-trees=<output name> ]\n" \
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
267 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
267 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
283 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| opt_tree_grafting.cpp | 31 * tertiary op handling, we'll end up with our expression trees having
34 * the deepest expression trees they can to try to optimize them.
|
| /external/chromium_org/third_party/protobuf/src/google/protobuf/ |
| text_format.cc | 103 // Remove any nested information trees, as they are owned by this tree.
119 vector<TextFormat::ParseInfoTree*>* trees = &nested_[field]; local
120 GOOGLE_CHECK(trees);
121 trees->push_back(instance);
156 const vector<TextFormat::ParseInfoTree*>* trees = FindOrNull(nested_, field); local
157 if (trees == NULL || index >= trees->size()) {
161 return (*trees)[index];
[all...] |
| /external/chromium_org/v8/benchmarks/ |
| splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
288 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| /external/mesa3d/src/glsl/ |
| opt_tree_grafting.cpp | 31 * tertiary op handling, we'll end up with our expression trees having
34 * the deepest expression trees they can to try to optimize them.
|
| /external/opencv/cv/src/ |
| cvmatchcontours.cpp | 212 // Calculates matching of the two contour trees
219 // threshold - threshold for the contour trees matching
|
| /external/v8/benchmarks/ |
| splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
288 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| /libcore/luni/src/main/java/javax/xml/transform/ |
| overview.html | 61 <br>One or more trees that are the inputs to the
67 <br>One or more trees that are the output of the
|
