|
==References==
{{Reflist}}
{{Refbegin}}
* {{citation | authorlink1 = John Cocke | first1 = John | last1 = Cocke | first2 = Jacob T. | last2 = Schwartz | year = 1970 | title = Programming languages and their compilers: Preliminary notes | journal = Technical report | publisher = [[Courant Institute of Mathematical Sciences]], [[New York University]] }}
* {{citation | authorlink1 last1= Tadao KasamiCocke | first1=John |author1-link=John T.Cocke |last2=Schwartz last1 |first2=Jacob KasamiT. | year = 19651970 | title =Programming An efficient recognitionlanguages and syntax-analysistheir algorithmcompilers: forPreliminary context-free languagesnotes | journal = ScientificTechnical report AFCRL-65-758 | publisher =[[Courant AirInstitute Forceof CambridgeMathematical Research Lab | ___location =Sciences]], [[Bedford,New MAYork University]] }}
* {{citation |last1=Kasami first |first1= Daniel HT. | last author1-link=Tadao YoungerKasami | year = 19671965 | title =An Recognitionefficient recognition and parsingsyntax-analysis ofalgorithm for context-free languages in time ''n''<sup>3</sup> | journal =Scientific Informationreport and ControlAFCRL-65-758 | volume publisher=Air 10Force |Cambridge issueResearch = 2Lab | pages ___location=[[Bedford, 189–208 | doi=10.1016/s0019-9958(67)80007-xMA]]}}
* {{citation |last1=Younger |first1=Daniel H. |year=1967 |title=Recognition and parsing of context-free languages in time ''n''<sup>3</sup> |journal=[[Information and Computation|Inform. Control]] |volume=10 |issue=2 |pages=189–208 |doi=10.1016/s0019-9958(67)80007-x}}
* {{citation |lastlast1=Knuth |firstfirst1=Donald E. |authorlinkauthor1-link=Donald E. Knuth |title=The Art of Computer Programming Volume 2: Seminumerical Algorithms |publisher=Addison-Wesley Professional |edition=3rd |date=November 14, 1997 |isbn=978-0-201-89684-8 |pages=501 }}
* {{Citation
| lastlast1=Lange
| firstfirst1=Martin
| last2=Leiß
| first2=Hans
| title=To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm
| year=2009
| journal=Informatica Didactica
| volume=8
| url=http://www.informatica-didactica.de/cmsmadesimple/index.php?page=LangeLeiss2009
}}
*{{Citation
| lastlast1=Sipser
| firstfirst1=Michael
| title=Introduction to the Theory of Computation
| publisher=IPS
| year=1997
| edition=1st
| page=99
| isbn =0-534-94728-X
}}
*{{Citation
| last last1= Lee
| first first1= Lillian
| title = Fast context-free grammar parsing requires fast Boolean matrix multiplication
| journal = [[Journal of the ACM|J. ACM]]
| volume = 49
| issue = 1
| pages = 1–15
| year = 2002
| doi = 10.1145/505241.505242
| postscript = .
}}
*{{citation |lastlast1=Valiant |firstfirst1=Leslie G. |authorlinkauthor1-link=Leslie G. Valiant |title=General context-free recognition in less than cubic time |journal=[[Journal of Computer and System Sciences|J. Comput. Syst. Sci.]] |volume=10 |issue=2 |year=1975 |pages=308–314 |doi=10.1016/s0022-0000(75)80046-8}}
*{{citation |lastlast1=Lang |firstfirst1=Bernard |title=Recognition can be harder than parsing |journal=[[Computational Intelligence (journal)|Comput. Intell.]] |year=1994 |volume=10 |issue=4 |pages=486–494 |id = {{citeseerx|10.1.1.50.6982}} |doi=10.1111/j.1467-8640.1994.tb00011.x}}
{{Refend}}
==External links==
| 