Skip to main content
SpringerLink
Log in

XML Grammars

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2000 (MFCS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1893))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Ginsburg and M. A. Harrison. Bracketed context-free languages. J. Comput. Syst. Sci., 1:1–23, 1967.

    MATH  MathSciNet  Google Scholar 

  2. Michael A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.

    MATH  Google Scholar 

  3. D. E. Knuth. A characterization of parenthesis languages. Inform. Control, 11:269–289, 1967.

    Article  MATH  Google Scholar 

  4. A. J. Korenjak and J. E. Hopcroft. Simple deterministic grammars. In 7th Switching and Automata Theory, pages 36–46, 1966.

    Google Scholar 

  5. R. McNaughton. Parenthesis grammars. J. Assoc. Mach. Comput., 14:490–500, 1967.

    MATH  MathSciNet  Google Scholar 

  6. W3C Recommendation REC-xml-19980210. Extensible Markup Language (XML) 1.0, 10 February 1998. http://www.w3.org/TR/REC-XML.

  7. W3C Working Draft. Canonical XML Version 1.0, 15 November 1999. http://www.w3.org/TR/xml-c14n.

Download references

Author information

Authors and Affiliations

  1. Institut Gaspard Monge (IGM), Université Marne-la-Vallée, F-77454, Marne-la-Vallée Cédex 2, France

    Jean Berstel

  2. Laboratoire d’informatique algorithmique: fondements et applications (LIAFA), Université Denis-Diderot, F-75251, Paris Cédex 05

    Luc Boasson

Authors
  1. Jean Berstel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luc Boasson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Department of Computer Sciene, Comenius University, 84248, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berstel, J., Boasson, L. (2000). XML Grammars. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44612-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67901-1

  • Online ISBN: 978-3-540-44612-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation