The axpath() method returns what is known as an augmented parse tree -- a parser tree with one extra node for the END_MARK.
axpath()方法返回称之为扩张的解析树 ―该解析树额外地带有一个表示 END_MARK 的节点。
So events for some of the tree nodes come through emulation, while for other nodes you are directly connected to the underlying parser.
因此有些树节点的事件是通过模拟而来的，而对于另一些节点则直接连接到底层的解析器。
The new filter API lets you examine and modify a document’s structure during parsing by asking a parser to accept, skip, or remove a node and its children from the resulting tree.
新的过滤器API使您可以在解析期间通过请求解析器接受、忽略一个节点及其子节点或者将它们从产生的树中删除，来检查和修改文档的结构。
The parser is the software that takes those meaningful words and builds a parse tree out of them by recognizing their type and purpose.
解析器是一种软件，它从文本获得那些有意义的单词，并通过识别这些单词的类型与用途，从中构建解析树。
Note that the parser passes enough information to build the document tree of the XML documents but, unlike a DOM parser, it does not explicitly build the tree.
请注意，语法分析器传递了足够信息以构建XML文档的文档树，但是与dom语法分析器不同，它并不显式地构建该树。
In other words, this governs the shape and content of the parse tree that's constructed by the parser.
换句话说，该构造管理由解析器构造的解析树的形状和内容。
Because this information is a few nodes down in the tree, dot notation is used to indicate the exact hierarchical position of the required nodes to the query parser.
因为此信息是树下的几个节点，所以点符号用于说明针对查询解析器的所需节点的确切层次位置。
The component of the broker that converts a bit stream into a logical message tree (parsing), and a logical message tree back into a bit stream (serializing or writing), is called a parser.
将位流转换为逻辑消息树（解析）以及将逻辑消息树转换回位流（序列化或编写）的代理组件称为解析器。
Only the parser needs to understand the physical format of the message -- the logical message tree is independent of the physical format of the message bit stream.
只有解析器才需要理解消息的物理格式——逻辑消息树与消息位流的物理格式无关。
A lack of a pure Ruby parser has been negligible for some time in Ruby's history, since getting the Abstract Syntax Tree (AST) of some Ruby code was possible with utilities such as ParseTree.
因为可以使用类似语法分析树(ParseTree)的通用方法来对Ruby代码进行分析并获得抽象语法树(Abstract Syntax Tree)，所以在Ruby历史上的一定时期内，纯ruby语法分析器的缺失被忽视了。
For example, if you tokenized a developerWorks article and sent it through an English-language parser, it might produce a tree structure like that shown in Figure 1.
例如，如果您将一篇 developerWorks 的文章做了标记并通过一个英语解析器将其发送，结果也许是如图1 中所示的树结构。
One approach to safe XML generation is sending SAX events, as Henri suggests in, "Use a tree or a stack (or an XML parser)."
正像 Herni 所提到的，安全创建XML 的一种方法是发送SAX事件，“使用树或栈（或者 XML解析器）”。
However, there is an experimental Python source code parser that treats a Python source file as a document tree.
然而，有一种实验性的python源代码解析器，它将python源文件作为文档树处理。
Note, however, that if the tree is built prior to calling either of the above methods, AXIOM will emulate the StAX parser.
但是请注意，如果在调用上述方法之前已经建立了树，AXIOM将模拟StAX解析器。
The SOAP nodes use the new SOAP parser and SOAP logical tree format. The new nodes are
SOAP节点使用新的 SOAP解析器和 SOAP逻辑树格式。
The parser reads the tree and describes it, through events, to your application.
语法分析器读取这棵树，并通过事件为应用程序描述它。
An item tree is a heavyweight object that takes time to build, and it is a structure you have to use an XML parser on.
一个条目树是一个重量级的对象，需要花时间去构建，并且它是一个您必须使用xml解析器才能解析的结构。
The parser must understand both the physical format of the bit stream and its logical structure in order to create the logical message tree.
解析器必须同时理解位流的物理格式及其逻辑结构才能创建逻辑消息树。
The easiest tree-based parser to code is SimpleXML.
编码最简单的基于树的解析器是SimpleXML。
The JRuby AST is the output of the parser and is just a tree representation of the source code, containing different kinds of nodes, for example for classes, methods, variables.
JRubyAST是解析器的输出结果，仅仅是源代码的树形表示，包含不同种类的节点，例如有类、方法和变量。
Then the prepared HTML code is added to the DOM tree, which triggers the Dojo parser to render the new fragment of the page.
然后将准备好的HTML代码添加到DOM树，从而触发Dojo解析器呈现页面的新片段。
The parser does this by creating a document tree using a document tree manager class.
剖析器会使用文件树状结构管理员类别建立文件树状结构，以达到这个目的。
The parser does this by creating a document tree using a document tree manager class.
剖析器会使用文件树状结构管理员类别建立文件树状结构，以达到这个目的。
应用推荐