@article{Earley1970,
 title = {An efficient context-free parsing algorithm},
 author = {Earley, Jay},
 year = {1970},
 doi = {10.1145/362007.362035},
 url = {https://doi.org/10.1145/362007.362035},
 journal = {Commun. ACM},
 volume = {13},
 number = {2},
 pages = {94–102},
 publisher = {Association for Computing Machinery},
 address = {New York, NY, USA},
 keywords = {compilers, computational complexity, context-free grammar, parsing, syntax analysis},
 numpages = {9},
 month = {feb},
 abstract = {A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n3 (where n is the length of the string being parsed) in general; it has an n2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.},
 issn = {0001-0782},
 issue_date = {Feb 1970}
}