Revision as of 11:13, 16 September 2021 edit AnomieBOT (talk \| contribs) Bots 6,855,669 edits m Dating maintenance tags: {{Citation needed}} ← Previous edit		Revision as of 07:09, 14 November 2021 edit undo Citation bot (talk \| contribs) Bots 5,861,755 edits Alter: pages. Add: s2cid. Formatted dashes. \| Use this bot. Report bugs. \| Suggested by Abductive \| #UCB_toolbar Next edit →
Line 132: == Sources == {{cite conference \|title= Syntax in universal translation \|last= Sakai \|first= Itiroo \|date= 1962 \|___location= London \|publisher= Her Majesty’s Stationery Office \|volume= II \|pages= ~~593-608~~593–608 \|conference= 1961 International Conference on Machine Translation of Languages and Applied Language Analysis, Teddington, England}} {{cite techreport \|last1=Cocke \|first1=John \|author-link1=John Cocke \|last2=Schwartz \|first2=Jacob T. \|date=April 1970 \|title=Programming languages and their compilers: Preliminary notes \|edition=2nd revised \|publisher=[[Courant Institute of Mathematical Sciences\|CIMS]], [[New York University\|NYU]] \|url=http://www.softwarepreservation.org/projects/FORTRAN/CockeSchwartz_ProgLangCompilers.pdf}} * {{cite book \| isbn=0-201-02988-X \| first1=John E. \| last1=Hopcroft \| author1-link=John E. Hopcroft \| first2=Jeffrey D. \| last2=Ullman \| author2-link=Jeffrey D. Ullman \| title=Introduction to Automata Theory, Languages, and Computation \| ___location=Reading/MA \| publisher=Addison-Wesley \| year=1979 \| url=https://archive.org/details/introductiontoau00hopc }} {{cite techreport \|last1=Kasami \|first1=T. \|author-link1=Tadao Kasami \|year=1965 \|title=An efficient recognition and syntax-analysis algorithm for context-free languages \|number=65-758 \|publisher=[[Air Force Cambridge Research Laboratories\|AFCRL]]}} {{cite book \|last1=Knuth \|first1=Donald E. \|author-link1=Donald Knuth \|title=The Art of Computer Programming Volume 2: Seminumerical Algorithms \|publisher=Addison-Wesley Professional \|edition=3rd \|date=November 14, 1997 \|isbn=0-201-89684-2 \|pages=501 }} {{cite journal \|last1=Lang \|first1=Bernard \|title=Recognition can be harder than parsing \|journal=[[Computational Intelligence (journal)\|Comput. Intell.]] \|year=1994 \|volume=10 \|issue=4 \|pages=486–494 \|citeseerx=10.1.1.50.6982 \|doi=10.1111/j.1467-8640.1994.tb00011.x \|s2cid=5873640 }} {{cite journal \|last1=Lange \|first1=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/index.php?page=LangeLeiss2009 }} {{cite journal \|last1=Lee \|first1=Lillian \|author-link=Lillian Lee (computer scientist)\|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 \|arxiv=cs/0112018 \|s2cid=1243491 }} {{cite book \|last1=Sipser \|first1=Michael \|author-link1=Michael Sipser \|title=Introduction to the Theory of Computation \|publisher=IPS \|year=1997 \|edition=1st \|page=[https://archive.org/details/introductiontoth00sips/page/99 99] \|isbn=0-534-94728-X \|url=https://archive.org/details/introductiontoth00sips/page/99 }} *{{cite journal \|last1=Valiant \|first1=Leslie G. \|author-link1=Leslie 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 \|doi-access=free }}

CYK algorithm: Difference between revisions