对于HC，该解析树表示一个XPath。
树构造器创建源XML文档的树表示法。
The tree constructor creates a tree representation of a source XML document.
利用八元树表示三维物体是一种十分有效的方法。
It is an efficient way to represent three-dimensional (3d) objects by octree.
它是二维(二值)图象线性四元树表示的一种推广。
It is an extension of the quadtree representation of two-dimensional (binary) images.
“结构视图”是在主窗格中被编辑的文档的分层树表示。
The "structure view" is a hierarchical tree representation of the document being edited in the main pane.
由构建器组件构造的树表示法是Saxon 的专利。
The tree representation constructed by the builder component is proprietary to Saxon.
使用解析树表示还会使调试变得更容易，并缩短开发时间。
Working with a parse tree representation also makes debugging easy and speeds development time.
利用八叉树表示物体，在实体造型系统中具有许多优点。
Using octree structure to present object in solid modelling systems has many advantages.
这种表示与四元树表示相比较，约节省存贮空间94%。
Compared with quadtree representation, the average space saving of P-quadtree representation is about 94%.
二元数组表示的图象使用的距离概念运用于线性四元树表示。
The concept of distance used in binary array representations of images is applied to a linear quadtree representation.
当您研究过JJTree及其解析树表示后，我将对此做更详细的研究。
I'll explore that in more detail once you've looked at JJTree and its parse tree representations.
第一种是GENERIC，它是一种通用的树表示法，由语言前端树构成。
The first is called generic, which is a generic tree representation that's formed from the language front-end trees.
文章对骨架的结构基元自顶向下地进行分解，将基元组织成层次树表示。
An algorithm constructing the hierarchical tree representation based on skeleton elements by top-down decomposition of object skeletons is presented in this paper.
随后，我们可以查看图1，其中展示了这个查询计划的等效符号树表示形式。
We can then examine the equivalent symbolic tree representation of this query plan in Figure 1.
显示一个层次结构树，该树表示分析运行中函数的执行路径和资源争用数据。
Displays a hierarchical tree that represents the execution paths and resource contention data of functions in the profiling run.
函数性语言被频繁地用来构建编译器或者解析语言的工具，因为语言通常是用语法树表示的。
Functional languages are used frequently for building compilers or tools that parse languages because languages are normally expressed as syntax trees.
该算法构造了前缀树表示序列模式，并用广度剪枝和深度剪枝维护该前缀树的结构。
It constructs a prefix tree to represent the sequence patterns, and continuously maintains the tree structure by using width pruning and depth pruning.
他在那篇文章里用了非常好的图表来表现说明一些Lambda树的表达式树表示形式。
He has a great diagram there showing the expression tree representation of a few lambda expressions.
本文通过对图象中客体的形心和主轴进行正规化处理而得到其标准线性四元树表示方法。
In This paper, a normalized linear quadtree representation is obtained by normalizing an object with respect to its centroid and principal axes.
该归档文件很可能创建为现有文件系统树的直接(局部)映像，所以自然可以用有根树表示。
This archive was probably created as the direct (partial) image of an existing filesystem tree, and is naturally represented by the rooted tree.
本文提出一种算法实现单连通区域的线性四元树表示转换成区域边界的4 -方向链码描述。
An algorithm is presented for converting the linear quadtree representation of a simply connected region into a 4-direction chain code description of the region's boundary.
在第2部分谈论有关JJTree工具和解析树表示时，我将回过头来更详细地讨论这一内容。
I'll come back to this in more detail when I talk about the JJTree tool and parse tree representations in Part 2.
本系列的第1部分中描述的soap节点为所有Web服务消息提供了一致的逻辑树表示形式。
The SOAP nodes described in Part 1 of this series provide a consistent logical tree representation for all Web services messages.
与dom和dom 4 j一样，AXIOM使用接口定义了用于访问和操作树表示的API。
Like dom and dom4j, AXIOM defines the API used to access and manipulate the tree representation using interfaces.
当它们不自动管理时，您总是会有方法在xml类树表示法中创建或避免创建一个名称空间节点。
Where they don't, you usually have a method to create or avoid creating a namespace node in the tree-like representation of the XML.
解析过程会将传入的V 5查询规范或任何潜在的嵌入式SQL或MDX查询转换成一个树表示。
The parsing process will convert the incoming V5 query spec and any potentially embedded SQL or MDX queries into a tree representation.
即使到目前为止您已经执行了所有操作，但您仍然没有足够的信息来计算该解析树表示的算术运算的结果。
With everything you've done so far, however, you still don't have quite enough information to calculate the results of the arithmetic operation represented by this parse tree.
本文根据逻辑程序的要求，设计了知识结构的三叉树表示法，并给出了基于这种表示的推理过程的框架。
Given the requirements of logical programming, a trinary-tree knowledge representation is proposed in this paper, and a framework of inference procedures based on the representation is given.
增强的JFS2在执行索引节点搜索时使用二叉树表示形式，与JFS使用的线性方法相比，这种方法要好得多。
Enhanced JFS2 USES a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.
针对高维几何布局问题中布局物体的建模问题，提出2-叉树方法，在一般维度下系统地给出了抽象物体的叉树表示法的构造。
With the modeling problem of layout items in high dimensional layout problem as the application object, this paper introduces the concept of 2n-tree representation.
应用推荐