An Efficient Context-Free Parsing Algorithm

Communications of the ACM

Volumn 13, Issue 2, 1970, Pages 94-102

  Earley, Jay ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

compilers; computational complexity; context free grammar; parsing; syntax analysis

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTERS, PROGRAMMING; CONTEXT-FREE GRAMMAR;

EID: 0014732304     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/362007.362035     Document Type: Article

References (9)

1. Earley, J. An efficient context-free parsing algorithm. Ph.D. Thesis, Comput. Sci. Dept., Carnegie-Mellon U., Pittsburgh, Pa., 1968.
2. Knuth, D. E. On the translation of languages from left to right. Information and Control 8 (1965), 607-639.
3. Floyd, R. W. The syntax of programming languages—a survey. IEEE Trans. EC-13, 4 (Aug. 1964).
4. Younger, D. H. Recognition and parsing of context-free languages in time n3. Information and Control 10 (1967), 189-208.
5. Hays, D. Automatic language-data processing. In Computer Applications in the Behavioral Sciences, H. Borko (Ed.) Prentice Hall, Englewood Cliffs, N.J., 1962.
6. Younger, D. H. Context-free language processing in time n3. General Electric R&D Center, Schenectady, N.Y., 1966.
7. Kasami, T., and Torii, K. A syntax-analysis procedure for unambiguous context-free grammars. J. ACM 16, 3 (July 1969), 423-431.
8. Griffiths, T., and Petrick, S. On the relative efficiencies of context-free grammar recognizers. Comm. ACM 8, 5 (May 1965), 289-300.
9. Feldman, J., and Gries, D. Translator writing systems. Comm. ACM 11, 2 (Feb. 1968), 77-113.