A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
暂无分享,去创建一个
[1] Edgar T. Irons. An error-correcting parse algorithm , 1963, CACM.
[2] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[3] Robert McNaughton,et al. Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..
[4] Melvin E. Conway,et al. Design of a separable transition-diagram compiler , 1963, CACM.
[5] Seymour Ginsburg,et al. Two Families of Languages Related to ALGOL , 1962, JACM.
[6] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .
[7] Robert W. Floyd,et al. Syntactic Analysis and Operator Precedence , 1963, JACM.
[8] Haim Gaifman,et al. Dependency Systems and Phrase-Structure Systems , 1965, Inf. Control..
[9] Victor H. Yngve,et al. A model and an hypothesis for language structure , 1960 .