The derivation language of a phrase structure grammar

Authors:
Johnson M. Hart
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1976

Citing 3
Cited 0

Formal languages and their relation to automata

Formal languages and their relation to automata
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
The relation between derivations and syntactical structures in phrase-structure grammars

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of representing derivations in general phrasestructuregrammars. By properly sorting the nodes, the syntactical graph of any derivation in a phrase-structure language can be expressed uniquely as a word in a context-sensitive language, just as the derivations in a context-free grammar can be expressed in the prefix form of a derivation tree. The set of all such graph representations is called the ''derivation language.'' Algorithms are given for obtaining the one-to-one correspondence between the set of syntactical graphs (of a grammar) and the derivation language. In the special case of context-free grammars, the results reduce to well-known properties of context-free derivations.