Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

MFCS
2000
Springer

favoriteEmaildiscussreport

67views Theoretical Computer Science» more MFCS 2000»

XML Grammars

14 years 2 months ago

Download www-igm.univ-mlv.fr

Abstract. 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 an 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.

Jean Berstel, Luc Boasson

Real-time Traffic

Document Type Definition | Formal Grammar | General Context-free Languages | MFCS 2000 | Theoretical Computer Science |

claim paper

Related Content

» Development of Corpora within the CLaRK System The BulTreeBank Project Experience

» Composable XML integration grammars

» XML Validation for ContextFree Grammars

» Spatial graph grammars for web information transformation

» XMLBased Data Preparation for Robust Deep Parsing

» An XML Viewer for Tabular Forms for Use with Mechanical Documentation

» HighPerformance XML Parsing and Validation with Permutation Phrase Grammar Parsers

» A Query Language for XML Based on Graph Grammars

» Inference of node replacement graph grammars

» Attribute Grammars for Scalable Query Processing on XML Streams

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	MFCS
Authors	Jean Berstel, Luc Boasson

Comments (0)