Taxonomy of XML schema languages using formal language theory
Top Cited Papers
- 1 November 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 5 (4), 660-704
- https://doi.org/10.1145/1111627.1111631
Abstract
On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).Keywords
This publication has 16 references indexed in Scilit:
- Extending Java for high-level Web service constructionACM Transactions on Programming Languages and Systems, 2003
- Regular expression pattern matching for XMLJournal of Functional Programming, 2003
- Boolean Operations for Attribute-Element ConstraintsLecture Notes in Computer Science, 2003
- XDuceACM Transactions on Internet Technology, 2003
- Keys for XMLComputer Networks, 2002
- Balanced Grammars and Their LanguagesPublished by Springer Science and Business Media LLC ,2002
- One-Unambiguous Regular LanguagesInformation and Computation, 1998
- Hypertext Markup Language - 2.0Published by RFC Editor ,1995
- Derivatives of Regular ExpressionsJournal of the ACM, 1964
- THE ABSTRACT THEORY OF AUTOMATARussian Mathematical Surveys, 1961