摘要
将树形数据结构用于最小化DOM模型XML编解码器的开发。在解析XML文本时,基于Expat解释器将XML字符串构造成树状结构;编码时构造DOM树结构,采用非递归深度优先法遍历树,将其串行化成XML串。本编解码器解决了国际化语言关键问题,是一个通用、高效的工业级XML应用支撑模块。
This paper designs a DOM liked tree data structure for developing a minimal DOM based eXtended Marked Language(XML) coding and encoding module. When parsing XML text, based on expat, it puts the parsed content into the tree. When encoding, it constructs a DOM tree, then use non-recursion depth-first method to access the tree and serialize it into XML text. This module also solves the key problem of international language, and forms an universal, highly effective and industrial-level-reached basic module for XML application.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第4期48-50,共3页
Computer Engineering