scientific article; zbMATH DE number 1116593
In this thesis context-free hypergraph grammars endowed with the jungle property, i.e. all sentential forms are jungles, are considered. It is proved that this property can be checked exploiting special properties of the production rules of the grammar. Moreover, based on those properties it is shown constructively that the family of term languages defined by context-free hypergraph grammars with the jungle property coincides with the family of term languages generated by L-attributed grammars or by IO macro grammars respectively. In the case of L-attributed grammars it is supposed that each syntactical element has only one synthesized attribute -- its meaning. Semantic functions are used to compute meaning in form of terms. So, the meaning of a word is a term and the set of the meanings of all words generated by the basic grammar of an L-attributed grammar is a term language. Finally, classes of different linear hypergraph grammars are introduced.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376265)