Context-free text grammars |
| |
Authors: | A Ehrenfeucht P ten Pas G Rozenberg |
| |
Affiliation: | (1) Department of Computer Science, University of Colorado at Boulder, 80309 Boulder, CO, USA;(2) Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands |
| |
Abstract: | A text is a triple=(,
1,
2) such that is a labeling function, and
1 and
2 are linear orders on the domain of ; hence may be seen as a word (,
1) together with an additional linear order
2 on the domain of . The order
2 is used to give to the word (,
1) itsindividual hierarchical representation (syntactic structure) which may be a tree but it may be also more general than a tree. In this paper we introducecontext-free grammars for texts and investigate their basic properties. Since each text has its own individual structure, the role of such a grammar should be that of a definition of a pattern common to all individual texts. This leads to the notion of ashapely context-free text grammar also investigated in this paper. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|