论文信息 - Tree Adjunct Grammars

Tree Adjunct Grammars

In this paper, a tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd (Information and Control14 (1969), 217-231) and Rounds (Mathematical Systems Theory 4 (1970), 257-287) and to the recognizable sets and local sets discussed by Thatcher (Journal of Computer and System Sciences1 (1967), 317-322; 4 (1970), 339-367) and Rounds. Linguistic relevance of these systems has been briefly discussed also.

[1] Aravind K. Joshi,et al. String Adjunct Grammars: I. Local and Distributed Adjunction , 1972, Inf. Control..

[2] Asa Kasher,et al. MEASURES OF SYNTACTIC COMPLEXITY , 1963 .

[3] James W. Thatcher,et al. Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[4] Walter S. Brainerd. Semi-Thue Systems and Representations of Trees , 1969, SWAT.

[5] James W. Thatcher,et al. Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[6] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.

[7] Aravind K. Joshi,et al. String Adjunct Grammars: II. Equational Representation, Null Symbols, and Linguistic Relevance , 1972, Inf. Control..

[8] Aravind K. Joshi,et al. A Class Of Transformational Grammars , 1973 .

[9] Saul Corn,et al. Explicit Definitions and Linguistic Dominoes , 1967 .

[10] Walter S. Brainerd,et al. Tree Generating Regular Systems , 1969, Inf. Control..

[11] Alfred V. Aho. Indexed Grammars-An Extension of Context Free Grammars , 1967, SWAT.

[12] L. S. Levy. Tree Adjunct, Parenthesis, and Distributed Adjunct Grammars , 1971 .