Abstract: This paper proposes a resolution to resolve the complex problem of transforming function expression between different XML language products. Based on the corresponding relationship between function expression and binary tree, the resolution adopts array of pre-order traversal and in-order traversal to identify the unique binary tree in XML document properties, so that the function expression can be generally resolved by other XML language products. The relative key technologies of parsing and transforming XML function expressions are researched and described in detail. The proposed resolution can improve the universality and efficiency of transforming function expression.

Key words: XML language, function expression, binary tree, identification, transformation

摘要：

针对在不同XML语言产品间实现函数计算表达式转换比较复杂的问题，提出在构建函数表达式对应二叉树结构的基础上，通过在XML文档属性设置中用中序、前序遍历序列对二叉树结构进行唯一标识，使其他XML语言产品实现通用解析，阐述XML函数表达式的解析和转换中的关键技术。该方法能提高XML函数表达式转换的通用性，并提高转换效率。

关键词: XML语言, 函数表达式, 二叉树, 标识, 转换

CLC Number: 

• TP312