{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:13Z","timestamp":1750220473969,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"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":[[2021,10,17]]},"DOI":"10.1145\/3486608.3486903","type":"proceedings-article","created":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T23:13:53Z","timestamp":1637622833000},"page":"113-125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster reachability analysis for LR(1) parsers"],"prefix":"10.1145","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Bour","sequence":"first","affiliation":[{"name":"Inria, France \/ Tarides, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4069-1235","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Pottier","sequence":"additional","affiliation":[{"name":"Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,22]]},"reference":[{"volume-title":"Ullman","year":"1972","author":"Aho Alfred V.","key":"e_1_3_2_2_1_1"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3344429.3372508"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63141-0_10"},{"volume-title":"Introduction to Algorithms","year":"1866","author":"Cormen Thomas H.","key":"e_1_3_2_2_4_1"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2009.08.001"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/69622.357187"},{"volume-title":"Practical Translators for LR(k) Languages","author":"DeRemer Franklin Lewis","key":"e_1_3_2_2_7_1"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/362619.362625"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_20"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159876.1159880"},{"volume-title":"Jacobs","year":"2008","author":"Grune Dick","key":"e_1_3_2_2_11_1"},{"key":"e_1_3_2_2_12_1","unstructured":"Masatomo Hashimoto. 2021. The Code Continuity Analysis Framework. https:\/\/github.com\/codinuum\/cca  Masatomo Hashimoto. 2021. The Code Continuity Analysis Framework. https:\/\/github.com\/codinuum\/cca"},{"volume-title":"Theory of Machines and Computations","author":"Hopcroft John E.","key":"e_1_3_2_2_13_1"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/937563.937566"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90426-2"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90002-3"},{"volume-title":"Reps","year":"2006","author":"Lal Akash","key":"e_1_3_2_2_17_1"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(81)90010-8"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90056-1"},{"key":"e_1_3_2_2_20_1","unstructured":"Xavier Leroy. 2021. The CompCert C compiler. http:\/\/compcert.org\/  Xavier Leroy. 2021. The CompCert C compiler. http:\/\/compcert.org\/"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706356.1706382"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3473582"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32759-9_26"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290336"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"},{"key":"e_1_3_2_2_26_1","unstructured":"Fran\u00e7ois Pottier. 2009. Lazy Least Fixed Points in ML. Dec. http:\/\/gallium.inria.fr\/~fpottier\/publis\/fpottier-fix.pdf Unpublished.  Fran\u00e7ois Pottier. 2009. Lazy Least Fixed Points in ML. Dec. http:\/\/gallium.inria.fr\/~fpottier\/publis\/fpottier-fix.pdf Unpublished."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Pottier. 2016. Reachability and error diagnosis in LR(1) parsers. In Compiler Construction (CC). 88\u201398. http:\/\/gallium.inria.fr\/~fpottier\/publis\/fpottier-reachability-cc2016.pdf  Fran\u00e7ois Pottier. 2016. Reachability and error diagnosis in LR(1) parsers. In Compiler Construction (CC). 88\u201398. http:\/\/gallium.inria.fr\/~fpottier\/publis\/fpottier-reachability-cc2016.pdf","DOI":"10.1145\/2892208.2892224"},{"key":"e_1_3_2_2_28_1","unstructured":"Fran\u00e7ois Pottier and Yann R\u00e9gis-Gianas. 2005\u20132021. The Menhir parser generator. https:\/\/gitlab.inria.fr\/fpottier\/menhir\/  Fran\u00e7ois Pottier and Yann R\u00e9gis-Gianas. 2005\u20132021. The Menhir parser generator. https:\/\/gitlab.inria.fr\/fpottier\/menhir\/"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.009"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11901914_13"},{"key":"e_1_3_2_2_31_1","unstructured":"Sean Talts. 2019. stanc3: rewriting the Stan compiler. https:\/\/statmodeling.stat.columbia.edu\/2019\/03\/13\/stanc3-rewriting-the-stan-compiler\/  Sean Talts. 2019. stanc3: rewriting the Stan compiler. https:\/\/statmodeling.stat.columbia.edu\/2019\/03\/13\/stanc3-rewriting-the-stan-compiler\/"},{"key":"e_1_3_2_2_32_1","unstructured":"Wikipedia. 2021. Hash-consing. https:\/\/en.wikipedia.org\/wiki\/Hash_consing  Wikipedia. 2021. Hash-consing. https:\/\/en.wikipedia.org\/wiki\/Hash_consing"},{"key":"e_1_3_2_2_33_1","unstructured":"Wikipedia. 2021. k-way merge algorithm. https:\/\/en.wikipedia.org\/wiki\/K-way_merge_algorithm  Wikipedia. 2021. k-way merge algorithm. https:\/\/en.wikipedia.org\/wiki\/K-way_merge_algorithm"},{"key":"e_1_3_2_2_34_1","unstructured":"Wikipedia. 2021. Matrix chain multiplication. https:\/\/en.wikipedia.org\/wiki\/Matrix_chain_multiplication  Wikipedia. 2021. Matrix chain multiplication. https:\/\/en.wikipedia.org\/wiki\/Matrix_chain_multiplication"}],"event":{"name":"SLE '21: 14th ACM SIGPLAN International Conference on Software Language Engineering","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Chicago IL USA","acronym":"SLE '21"},"container-title":["Proceedings of the 14th ACM SIGPLAN International Conference on Software Language Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3486608.3486903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3486608.3486903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:39Z","timestamp":1750193319000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3486608.3486903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":34,"alternative-id":["10.1145\/3486608.3486903","10.1145\/3486608"],"URL":"https:\/\/doi.org\/10.1145\/3486608.3486903","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]},"assertion":[{"value":"2021-11-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}