Revision as of 10:25, 20 February 2010 edit Hermel (talk \| contribs) Extended confirmed users, Pending changes reviewers 2,052 edits →Parsing non-CNF context-free grammars: replaced unsubstantiated statement ← Previous edit		Revision as of 10:27, 20 February 2010 edit undo Hermel (talk \| contribs) Extended confirmed users, Pending changes reviewers 2,052 edits →References: ref added Next edit →
Line 82: * [[Tadao Kasami\|T. Kasami]] (1965). An efficient recognition and syntax-analysis algorithm for context-free languages. Scientific report AFCRL-65-758, Air Force Cambridge Research Lab, [[Bedford, MA]]. * Daniel H. Younger (1967). Recognition and parsing of context-free languages in time ''n''<sup>3</sup>. ''Information and Control'' 10(2): 189–208. * Martin Lange and Hans Leiß. [http://www.informatica-didactica.de/InformaticaDidactica/LangeLeiss2009 ''To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm.''] Informatica Didactica 8, 2009. [http://www.informatica-didactica.de/InformaticaDidactica/LangeLeiss2009.pdf (pdf)] ==External links==

CYK algorithm: Difference between revisions