{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:08Z","timestamp":1772164028895,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,25]]},"DOI":"10.1145\/2500365.2500576","type":"proceedings-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T09:13:17Z","timestamp":1380100397000},"page":"111-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient divide-and-conquer parsing of practical context-free languages"],"prefix":"10.1145","author":[{"given":"Jean-Philippe","family":"Bernardy","sequence":"first","affiliation":[{"name":"Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden"}]},{"given":"Koen","family":"Claessen","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90202-7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411286.1411294"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596638.1596645"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/248932"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(59)90362-6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90199-C"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796804005192"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1097042"},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms , second ed. MIT press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms, second ed. MIT press, 2001."},{"key":"e_1_3_2_1_10_1","first-page":"175","volume-title":"BNFC Quick reference","author":"Forsberg M.","year":"2012","unstructured":"M. Forsberg and A. Ranta . BNFC Quick reference , chapter Appendix A, pages 175 -- 192 . College Publications , 2012 . M. Forsberg and A. Ranta. BNFC Quick reference, chapter Appendix A, pages 175--192. College Publications, 2012."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944727"},{"key":"e_1_3_2_1_12_1","volume-title":"DTIC Document","author":"Kasami T.","year":"1965","unstructured":"T. Kasami . An efficient recognition and syntax analysis algorithm for context-free languages. Technical report , DTIC Document , 1965 . T. Kasami. An efficient recognition and syntax analysis algorithm for context-free languages. Technical report, DTIC Document, 1965."},{"key":"e_1_3_2_1_13_1","first-page":"2009","article-title":"To CNF or not to CNF? an efficient yet presentable version of the CYK algorithm","author":"Lange M.","year":"2008","unstructured":"M. Lange and H. Lei\u00df . To CNF or not to CNF? an efficient yet presentable version of the CYK algorithm . Informatica Didactica (8)( 2008 --2010), 2009 . M. Lange and H. Lei\u00df. To CNF or not to CNF? an efficient yet presentable version of the CYK algorithm. Informatica Didactica (8)(2008--2010), 2009.","journal-title":"Informatica Didactica (8)("},{"key":"e_1_3_2_1_14_1","volume-title":"The Criterion benchmarking library","author":"O'Sullivan B.","year":"2013","unstructured":"B. O'Sullivan . The Criterion benchmarking library , 2013 . B. O'Sullivan. The Criterion benchmarking library, 2013."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90070-3"},{"key":"e_1_3_2_1_16_1","first-page":"61","volume-title":"Parsing of context-free languages","author":"Sikkel K.","year":"1997","unstructured":"K. Sikkel and A. Nijholt . Parsing of context-free languages , pages 61 -- 100 . Springer-Verlag , 1997 . K. Sikkel and A. Nijholt. Parsing of context-free languages, pages 61--100. Springer-Verlag, 1997."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/537456"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80046-8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/293677.293678"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)80007-X"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Northeastern University"]},"container-title":["Proceedings of the 18th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500576","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2500365.2500576","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:34:32Z","timestamp":1750217672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":21,"alternative-id":["10.1145\/2500365.2500576","10.1145\/2500365"],"URL":"https:\/\/doi.org\/10.1145\/2500365.2500576","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544174.2500576","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,25]]},"assertion":[{"value":"2013-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}