Due to partial parsing the message tree will not be parsed completely and the message will be routed to next node.
由于对消息树进行部分解析时并不会完全解析，因此消息将路由到下一个节点。
Tree style parsing involves loading the entire XML document into memory.
树解析方式需要将整个XML文档加载到内存中。
The parsing stage creates arbitrary tree structures on the basis of token lists.
解析阶段在记号列表的基础上创建任意的树结构。
Unlike tree style parsing, stream parsing does not load the entire XML document into memory.
和树解析方式不同，流解析不需要将整个文档加载到内存中。
Such modifications of the document structure during parsing can result in a smaller memory footprint for the DOM tree, and also reduce the time spent traversing a document and modifying it in memory.
这种在解析期间修改文档结构的做法可以使 DOM树占用更少的内存，而且还可以减少在内存中遍历和修改文档时所花的时间。
In the same place if ESQL is used with a better logic, then the processing cost would be drastically different with more benefits as complete message tree parsing is not needed.
同时，如果ESQL与更好的逻辑一起使用，则处理成本将大幅度减少，因为不需要解析完整的消息树，所得到的好处更多。
Target parsing can be reasonably fast and does not generate a memory-consuming parse tree, but all events fire for all elements in the data.
目标解析可以实现合理的速度并且不会生成消耗内存的解析树，但是在数据中为所有元素触发事件。
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使您可以在解析期间通过请求解析器接受、忽略一个节点及其子节点或者将它们从产生的树中删除，来检查和修改文档的结构。
When parsing, quotes cause all enclosed characters to be treated as data and not potentially as markup, and the quotes are always stripped before data is added to the tree.
在解析时，引号导致将其中包括的所有字符视为数据，而不会潜在地将其视为标记，并且始终会在将数据添加到树之前删除引号。
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.
将位流转换为逻辑消息树（解析）以及将逻辑消息树转换回位流（序列化或编写）的代理组件称为解析器。
The parsing stage might be considered the most complicated, as it requires a somewhat recursive design to parse the XML tree.
解析阶段可能是最复杂的，因为它需要一定程度的递归设计来解析xml树。
Parsing can then occur, and the resultant DOM Document object is handed off to a method that prints the DOM tree.
然后，就可以进行语法分析了，产生的DOMDocument对象传递给打印dom树的方法。
You can look through the source code for the file rxp.c to see the way that RXP parsing generates a compact document tree as a data structure.
可以分析rxp . c文件的源代码，以了解rxp解析生成紧凑文档树作为数据结构的方法。
Part 2 will show you how to take advantage of the two major schools of XML parsing for Perl developers: tree parsing and event-driven parsing.
第 2部分将讲解如何在Perl中进行两种主要的XML解析：树解析和事件驱动的解析。
When building an in-memory tree is not desired or practical, use an iterative parsing technique that does not rely on reading the entire source file. LXML offers two approaches.
如果构建内存树并不是必须的或并不实际，则可以使用一种迭代解析技术，这种技术不需要读取整个源树。
InfoQ: How did you make your technical choice like using parse tree for parsing and building AST Ruby?
InfoQ：你如何做技术上的选择，比如解析使用parsetree，以及构建ASTRuby ？
After parsing, the most common XML task is to locate specific data of interest inside the parsed tree.
完成解析后，最常见的XML任务是在解析后的树中查找特定的数据。
The same could be said about any other API, whether it's intended for parsing XML, reading property files, or creating tree-based structures in memory.
同样的问题也适用于其他API，无论是解析xml、读取属性文件还是在内存中创建树状结构的API。
The parsing process will convert the incoming V5 query spec and any potentially embedded SQL or MDX queries into a tree representation.
解析过程会将传入的V 5查询规范或任何潜在的嵌入式SQL或MDX查询转换成一个树表示。
It can also be thought of as parsing out chunks of information from a page. Web pages are coded in HTML, which uses a tree-like structure to represent the information.
页面抓取本质上是HTML页面的反向工程，也可以看成页面解释器，网页以HTML编码，HTML以树型结构表示信息，实际数据与布局代码以及效果信息混杂在一起，不能被计算机直接利用。
Understanding absolute values in expression parsing to binary tree?
了解表达式的解析树的绝对值？
Adopting bottom-up parsing algorithms, the parse analyse the sequence of tokens and form the syntax tree of EP program.
语法分析采用自底向上分析方法，根据语言语法分析标记序列，构建程序的语法树。
Parsing of global query generates a query tree.
查询语句解析产生查询树。
An approach to the hierarchical representation of self-embedded waveform by a feature tree based on peak dominance relations is proposed and a waveform parsing system is described.
基于波峰、波谷的支配与从属关系，对具有自嵌套结构的波形提出了一种特征层次树描述方法，并建立了相应的波形分类系统。
However, this method separates the two processes of parsing and extracting and therefore restricts the speed. Actually, parsing the whole DOM tree is unnecessary.
这种传统方法将解析dom树和从DOM树中提取信息看成两个独立的过程，制约了提取信息的速度。
Data transformation means parsing an input XML document into a tree of nodes, and then converting the source tree into a result tree. Transformation is about data exchange.
数据转换则意味着将输入的XML文档解析为一棵树，并将源树转换为目标树，是关于数据上的变换。
The user is responsible for parsing their unique XML format, generating an activity tree, and providing the root of the activity tree to the workflow runtime for execution.
用户负责分析其独有的XML格式、生成活动树并向工作流运行时提供要执行的活动树的根。
The user is responsible for parsing their unique XML format, generating an activity tree, and providing the root of the activity tree to the workflow runtime for execution.
用户负责分析其独有的XML格式、生成活动树并向工作流运行时提供要执行的活动树的根。
应用推荐