论文信息 - On line context free language recognition in less than cubic time(Extended Abstract)

On line context free language recognition in less than cubic time(Extended Abstract)

A new on-line context free language recognition algorithm is presented which is derived from Earley's algorithm and has several advantages over the original. First, the new algorithm not only is conceptually simpler than Earley's, but also allows significant speed improvements. Second, our algorithm serves to explain the connections between Earley's algorithm and the Cocke-Kasami-Younger algorithm. Third, our algorithm allows an implementation which uses only 0(n2/log n) operations on bit vectors of length n, or 0(n3/log n) operations on a RAM. This makes it the fastest known on-line context free language recognition algorithm.

[1] Tadao Kasami,et al. An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .

[2] Daniel H. Younger,et al. Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[3] Alain Pirotte,et al. Efficient parsing algorithms for general context-free parsers , 1975, Inf. Sci..

[4] C B Jones. Formal development of correct algorithms: An example based on earley's recogniser , 1972 .

[5] Gordon Lyon,et al. Syntax-directed least-errors analysis for context-free languages , 1974, Commun. ACM.

[6] Michael A. Harrison,et al. Parsing of General Context-Free Languages , 1976, Adv. Comput..

[7] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..

[8] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.

[9] Leslie G. Valiant,et al. General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[10] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .