Please use this identifier to cite or link to this item:
Title: Structured Document Transformations Based on XSL
Authors: Maneth, Sebastian
NEVEN, Frank 
Issue Date: 2000
Publisher: Publisher: Springer-Verlag GmbH
Source: Research Issues in Structured and Semistructured Database Programming. p. 80-98
Series/Report no.: 1949
Abstract: Based on the recursion mechanism of the XML transformation language XSL, the document transformation language is defined. First the instantiation is considered that uses regular expressions as pattern language. This instantiation closely resembles the navigation mechanism of XSL. For the complexity of relevant decision problems such as termination of programs, usefulness of rules and equivalence of selection patterns, is addressed. Next, a much more powerful ion of XSL is considered that uses monadic second-order logic formulas as pattern language ( ). If is restricted to top-down transformations ( ), then a computational model can be defined which is a natural generalization to unranked trees of top-down tree transducers with look-ahead. The look-ahead can be realized by a straightforward bottom-up pre-processing pass through the document. The size of the output of an XSL program is at most exponential in the size of the input. By restricting copying in XSL a decidable fragment of programs is obtained which induces transformations of linear size increase (safe ). It is shown that the emptiness and finiteness problems are decidable for ranges of programs and that the ranges are closed under intersection with generalized Document Type Definitions (DTDs).
Document URI:
Link to publication:
ISBN: 978-3-540-41481-0
Category: A1
Type: Journal Contribution
Appears in Collections:Research publications

Show full item record

Page view(s)

checked on May 23, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.