XML Grammars

  • Jean Berstel
  • Luc Boasson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1893)


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.


Regular Language Extensible Markup Formal Grammar Formal Language Theory Simple Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Ginsburg and M. A. Harrison. Bracketed context-free languages. J. Comput. Syst. Sci., 1:1–23, 1967.zbMATHMathSciNetGoogle Scholar
  2. 2.
    Michael A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.zbMATHGoogle Scholar
  3. 3.
    D. E. Knuth. A characterization of parenthesis languages. Inform. Control, 11:269–289, 1967.zbMATHCrossRefGoogle Scholar
  4. 4.
    A. J. Korenjak and J. E. Hopcroft. Simple deterministic grammars. In 7th Switching and Automata Theory, pages 36–46, 1966.Google Scholar
  5. 5.
    R. McNaughton. Parenthesis grammars. J. Assoc. Mach. Comput., 14:490–500, 1967.zbMATHMathSciNetGoogle Scholar
  6. 6.
    W3C Recommendation REC-xml-19980210. Extensible Markup Language (XML) 1.0, 10 February 1998.
  7. 7.
    W3C Working Draft. Canonical XML Version 1.0, 15 November 1999.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Jean Berstel
    • 1
  • Luc Boasson
    • 2
  1. 1.Institut Gaspard Monge (IGM)Université Marne-la-ValléeFrance
  2. 2.Laboratoire d’informatique algorithmique: fondements et applications (LIAFA)Université Denis-DiderotParis Cédex 05

Personalised recommendations