Content deleted Content added
→top: explicit ref. for complexity |
→References: H+U 1979 |
||
Line 106:
{{Refbegin}}
*{{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 | author1=John E. Hopcroft |author1link=John E. Hopcroft |author2= Jeffrey D. Ullman |author2link= Jeffrey D. Ullman| title=Introduction to Automata Theory, Languages, and Computation | ___location=Reading/MA | publisher=Addison-Wesley | year=1979 }}
*{{cite techreport |last1=Kasami |first1=T. |authorlink1=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. |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}}
| |||