Content deleted Content added
→References: again |
→References: removed ((reflist)), ((refbeing)), ((refend)), as I couldn't see its purpose; feel free to undo if I'm wrong here |
||
Line 103:
==References==
*{{cite techreport |last1=Cocke |first1=John |authorlink1=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 |author1link=John E. Hopcroft |first2= Jeffrey D. |last2=Ullman |author2link= Jeffrey D. Ullman| title=Introduction to Automata Theory, Languages, and Computation | ___location=Reading/MA | publisher=Addison-Wesley | year=1979 |ref=harv }}
Line 110 ⟶ 108:
*{{cite book |last1=Knuth |first1=Donald E. |authorlink1=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 |ref=harv}}
*{{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 |id={{citeseerx|10.1.1.50.6982}} |doi=10.1111/j.1467-8640.1994.tb00011.x |ref=harv}}
*{{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/cmsmadesimple/index.php?page=LangeLeiss2009 |ref=harv}}
*{{cite journal |last1=Lee |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 |ref=harv}}
| |||