Recognition and parsing of context-free languages in time n3*
作者： Daniel H. Younger
DOI: 10.1016/S0019-9958(67)80007-X
关键词:
摘要: A recognition algorithm is exhibited whereby an arbitrary string over a given vocabulary can be tested for containment in a given context-free language. A special merit of this algorithm …
elsevier.com
sci-hub.se 参考文章(9)
R. Duncan Luce, Eugene Galanter, Robert R. Bush, Handbook of mathematical psychology: I. John Wiley. ,(1963)
Susumu Kuno, The predictive analyzer and a path elimination technique Communications of the ACM. ,vol. 8, pp. 453- 462 ,(1965) , 10.1145/364995.365689
F. C. Hennie, R. E. Stearns, Two-Tape Simulation of Multitape Turing Machines Journal of the ACM. ,vol. 13, pp. 533- 546 ,(1966) , 10.1145/321356.321362
Noam Chomsky, On certain formal properties of grammars Information & Computation. ,vol. 2, pp. 137- 167 ,(1959) , 10.1016/S0019-9958(59)90362-6
J. Hartmanis, R. E. Stearns, On the computational complexity of algorithms Transactions of the American Mathematical Society. ,vol. 117, pp. 285- 306 ,(1965) , 10.1090/S0002-9947-1965-0170805-7
E. N. Gilbert, E. F. Moore, Variable-Length Binary Encodings Bell System Technical Journal. ,vol. 38, pp. 933- 967 ,(1959) , 10.1002/J.1538-7305.1959.TB01583.X
Tadao Kasami, An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages Coordinated Science Laboratory, University of Illinois at Urbana-Champaign. ,(1965)
P. M. Lewis, R. E. Stearns, J. Hartmanis, Memory bounds for recognition of context-free and context-sensitive languages foundations of computer science. pp. 191- 202 ,(1965) , 10.1109/FOCS.1965.14
R. E. Stearns, J. Hartmanis, P. M. Lewis, Hierarchies of memory limited computations foundations of computer science. pp. 179- 190 ,(1965) , 10.1109/FOCS.1965.11