Reasoning about XML Schema Languages using Formal Language Theory (2000)
| Venue: | Technical Report, IBM Almaden Research Center, RJ# 10197, Log# 95071 |
| Citations: | 35 - 4 self |
BibTeX
@TECHREPORT{Lee00reasoningabout,
author = {Dongwon Lee and Murali Mani and Makoto Murata},
title = {Reasoning about XML Schema Languages using Formal Language Theory},
institution = {Technical Report, IBM Almaden Research Center, RJ# 10197, Log# 95071},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A mathematical framework using formal language theory to describe and compare XML schema languages is presented. Our framework uses the work in two related areas -- regular tree languages [CDG + 97] and ambiguity in regular expressions [BEGO71, BKW98]. Using these work as well as the content in two classical references [HU79, AU79], we present the following results: (1) a normal form representation for regular tree grammars, (2) a framework of marked regular expressions and model groups, and their ambiguities, (3) five subclasses of regular tree grammars and their corresponding languages to describe XML content models: regular tree languages, TD(1) (top-down input scan with 1-vertical lookahead), single-type constraint languages, TDLL(1) (top-down and left-right input scan with 1-vertical and 1-horizontal lookaheads) , and local tree languages, (4) the closure properties of the five language classes under boolean set operations, (5) a classification and comparison of a few ...
