Journal of the ACM (JACM)
Introduction to Formal Language Theory
Introduction to Formal Language Theory
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Simple deterministic languages
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Bracketed context-free languages
Journal of Computer and System Sciences
Chart-parsing techniques and the prediction of valid editing moves in structured document authoring
Proceedings of the 2004 ACM symposium on Document engineering
Complexity results on balanced context-free languages
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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.