On the tree-transformation power of XSLT

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. A crucial new feature of version~2.0, however, which allows nodesets over temporary trees, yields completeness. We provide a formal operational semantics for XSLT programs, and establish confluence for this semantics

Software Usability:A Comparison Between Two Tree-Structured Data Transformation Languages

This paper presents the results of a software usability study, involving both subjective and objective evaluation. It compares a popular XML data transformation language (XSLT) and a general purpose rule-based tree manipulation language which addresses some of the XML and XSLT limitations. The benefits of the evaluation study are discussed

Home-grown CASE tools with XML and XSLT

This paper demonstrates an approach to software generation where xml representations of models are transformed to implementations by XSLT style sheets. Although XSLT was not primarily intended for this use, it serves quite well. There are only few problems in this approach, and we identify these based on our examples

Refining queries on a treebank with XSLT filters. Approaching the universal quantifier

This paper discusses the use of XSLT stylesheets as a filtering mechanism for refining the results of user queries on treebanks. The discussion is within the context of the TIGER treebank, the associated search engine and query language, but the general ideas can apply to any search engine for XML-encoded treebanks. It will be shown that important classes of linguistic phenomena can be accessed by applying relatively simple XSLT templates to the output of a query, effectively simulating the universal quantifier for a subset of the query language

Using SVG and XSLT for graphic representation

Using SVG and XSLT for graphic representation In this paper we will present an XML based framework that can be used to produce graphical visualisation of scientific data. The approach rather than producing ordinary histogram and function diagaram graphs, tries to represent the information in a more graphical appealing and easy to understand way. For examples the approach will give the ability to represent the temperature as the level of coulored fluid in a thermometer. The proposed framework is able to maintain the value of the datas strictly separated from the visual form of its representation (positions of element, colours, visual representation etc.). By defining appropriate data structures and expressing them using XML, the framework gives the user the ability to create graphic representations using standard SVG and XSLT. Since XML can be used for describing complex data information, we represent every level of the graphic representation with an XML structure. To describe our architecture we defined the following XML dialects, each one with different markup tags, reflecting the semantical values of the elements. Data definition level. Used to define the value of the datas that can be used in the graphic representation Data representation level. Used to define the graphic representation, it defines how the values expressed by the data definition level are represented. Both data representation and data definition files are based on a DTD to impose the constraints. Data representation level is the core of the system, and defines a powerful language for representation. Source primitives. Used to define for the source of the graphic elements, for example static file or SVG code. Modification primitives. Used to define the modifications that can affect a graphic element, for example rotation, scaling or repetition. Disposition primitives. Used to define the possible dispositions along x, y and z axes, for example to impose a order in the representation of elements. Action primitives. Used to define the possible actions that canbe activated by graphic elements for different user behaviours. For example a mouse action can activate a link to a different resource, or can change the value of any of the other primitives of the data structure, as image source or disposition, or can show a tooltip . XSLT is used to output a SVG file derived from the two files describing the graphic representation. Our aim is to provide an abstract language to be used to represent in different ways the same concept. In fact, we can link a data definition file with different data representation levels, providing different kinds and levels of complexity for the same concept. An example use could be the representation of the temperature described before, where the temperature itself could be represented either as the level of mercury in the termomether, or as the rotation of an arrow in a gauge. The transformation process is made from an XML source tree into an XML result tree, using XPath to define patterns. XSLT transformation process is based on templates, that define some actions (like adding or removing elements, or sorting them) to be performed when a part of the document matches a template. To implement some of the complex graphics operations we are using XSLT extensions that allow to perform mathematical operations. These XSLT extensions are not yet standard and require specific compliant parser, as Apache Xalan, that allows the developer to interface with Java classes in order to increase XSLT areas of application, from simple node transformations to quite complex operations

On an evaluation of transformation languages in a fully XML-driven framework for video content adaptation

Bitstream Structure Descriptions (BSDs) allow taking the complexity of transforming scalable bitstreams from the compressed domain to the semantic domain. These descriptions are an essential part of an XUL-driven video adaptation framework. The performance of a BSD transformation engine is very important in such an architecture. This paper evaluates the efficiency of XML-based transformation languages in our video adaptation framework. XSLT, STX, and a hybrid solution are compared to each other in terms of execution times, memory consumption, and user-friendliness. Our experiments show that STX is the preferred solution when speed and low-memory are important. The hybrid solution is competitive in terms of memory consumption and is more user-friendly than STX. Although XSLT is relative fast, its memory consumption is very high

Solving the TTC 2011 Compiler Optimization Case with QVTR-XSLT

In this short paper we present our solution for the Compiler Optimization case study of the Transformation Tool Contest (TTC) 2011 using the QVTR-XSLT tool. The tool supports editing and execution of the graphical notation of QVT Relations languageComment: In Proceedings TTC 2011, arXiv:1111.440