封面圖片

On the tree-transformation power of XSLT

Guardado en:
發表在:Acta Informatica vol. 43, no. 6 (Jan 2007), p. 371-393
主要作者: Janssen, Wim
其他作者: Korlyukov, Alexandr, Van den Bussche, Jan
出版:
Springer Nature B.V.
主題:
Studies
Programming languages
Extensible Markup Language
Computer programming
Simulation
Data models
Power
Semantics
Trees
在線閱讀:Citation/Abstract
Full Text
Full Text - PDF
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
Resumen:XSLT is a standard rule-based programming language for expressing transformations of XML data. The language is currently in transition from version 1.0 to 2.0. In order to understand the computational consequences of this transition, we restrict XSLT to its pure tree-transformation capabilities. Under this focus, we observe that XSLT 1.0 was not yet a computationally complete tree-transformation language: every 1.0 program can be implemented in exponential time, using a DAG representation of trees. A crucial new feature of version 2.0, however, which allows node sets over temporary trees, yields completeness. We provide a formal operational semantics for XSLT programs, and establish confluence for this semantics. [PUBLICATION ABSTRACT]
ISSN:0001-5903
1432-0525
DOI:10.1007/s00236-006-0026-8
Fuente:ABI/INFORM Global