A high -level specification language for structured document transformation
Salvato in:
| Pubblicato in: | ProQuest Dissertations and Theses (2003) |
|---|---|
| Autore principale: | |
| Pubblicazione: |
ProQuest Dissertations & Theses
|
| Soggetti: | |
| Accesso online: | Citation/Abstract Full Text - PDF |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| Abstract: | The purpose of this thesis is to introduce and study the problem of automatic transformation of structured documents. We consider instances taken from a collection of documents that share a common structure in the sense that they can all be characterized by grammar rules such as found in a context-free grammar (CFG) or forest-regular grammar (FRG). Thus a single XML (or SGML) document with accompanying DTD (document type definition) is structured. As long as documents do not all conform to a single universal standard, data transformation remains a problem. Thus in the absence of a universal tag set and schema, structured document transformation is important for XML to serve as the data interchange format for the Web. Recently, W3C proposed XSLT (Extensible Stylesheet Language Transformations) as a transformation language for XML data. This language has considerable computation power. However, it requires detailed and tedious programming to accomplish complex structure transformations. Many XML query languages, such as XQuery, XML-QL and XML-GL, provide transformation capabilities to varying degrees, but these are poor specification languages for structural transformation. As alternatives, SDT (Syntax Directed Translation) and its extended form TT (Tree Transformation) grammar are widely used to specify transformations of source code in various programming languages, and they have been proposed as specification languages for structured document transformation. These languages are descriptive but have limited expressive power, which makes them unable to specify complex structure transformations. We therefore propose a new high-level specification language, called Paired SynTrees, based on grammar trees and syntax trees. With clearly defined syntax and carefully designed semantics, we show that our language is both descriptive and expressive. We also provide algorithms to convert our specification to XSLT for executing the transformation. Based on the algorithms, we present a prototype implementation. Finally, we explore various optimization techniques for generating more efficient XSLT programs. |
|---|---|
| ISBN: | 9780612849327 |
| Fonte: | ProQuest Dissertations & Theses Global |