Balanced Grammars and Their Languages
Balanced grammars are a generalization of parenthesis grammars in two directions. First, several kind of parentheses are allowed. Next, the set of right-hand sides of productions may be an infinite regular language. XML-grammars are a special kind of balanced grammars. This paper studies balanced grammars and their languages. It is shown that there exists a unique minimal balanced grammar equivalent to a given one. Next, balanced languages are characterized through a property of their syntactic congruence. Finally, we show how this characterization is related to previous work of McNaughton and Knuth on parenthesis languages.
KeywordsEquivalence Class Derivation Tree Initial Letter Grammar Generate Deterministic Automaton
Unable to display preview. Download preview PDF.
- 1.J. Berstel and L. Boasson. XML-grammars. In MFCS 2000 Mathematical Foundations of Computer Science (M. Nielsen and B. Rovan, Eds.), Springer-Verlag, Lect. Notes Comput. Sci. 1893, pages 182–191, 2000.Google Scholar
- 3.N. Chomsky and M.P. Schützenberger. The Algebraic Theory of Context-Free Languages. In Computer Programming and Formal Systems (P. Braffort and D. Hirschberg, Eds.), North-Holland, Amsterdam, pages 118–161, 1963.Google Scholar
- 7.A.J. Korenjak and J.E. Hopcroft. Simple Deterministic Grammars. In 7th Switching and Automata Theory, pages 36–46, 1966.Google Scholar
- 9.W3C Recommendation REC-xml-19980210. Extensible Markup Language (XML) 1.0, 10 February 1998. http://www.w3.org/TR/REC-XML.
- 10.W3C Working Draft. XML Schema Part 0,1 and 2, 22 September 2000. http://www.w3.org/TR/xmlschema-0,1,2.