Computer Science – Discrete Mathematics
Scientific paper
2000-11-07
Computer Science
Discrete Mathematics
24 pages
Scientific paper
XML documents are described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties of this family of grammars. We show that every XML-language basically has a unique XML-grammar. We give two characterizations of languages generated by XML-grammars, one is set-theoretic, the other is by a kind of saturation property. We investigate decidability problems and prove that some properties that are undecidable for general context-free languages become decidable for XML-languages. We also characterize those XML-grammars that generate regular XML-languages.
Berstel Jean
Boasson Luc
No associations
LandOfFree
Formal Properties of XML Grammars and Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Formal Properties of XML Grammars and Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal Properties of XML Grammars and Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-465861