{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:06Z","timestamp":1750221126049,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"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":[[2019,4,8]]},"DOI":"10.1145\/3297280.3297433","type":"proceedings-article","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:18:47Z","timestamp":1556713127000},"page":"1526-1533","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["CPEG"],"prefix":"10.1145","author":[{"given":"Daisuke","family":"Yamaguchi","sequence":"first","affiliation":[{"name":"Yokohama National University, Yokohama, Kanagawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimio","family":"Kuramitsu","sequence":"additional","affiliation":[{"name":"Japan Women's University, Bunkyo-ku, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,4,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429129"},{"key":"e_1_3_2_1_2_1","unstructured":"H. Comon M. Dauchet R. Gilleron C. L\u00f6ding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. 2007. Tree Automata Techniques and Applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata. release October 12th 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111320.1111039"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964011"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159829"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133987"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941946"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/767193.767195"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1053468.1053470"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1507238.1507239"},{"key":"e_1_3_2_1_11_1","volume-title":"Yacc: Yet another compiler-compiler.","author":"Johnson Stephen C","year":"1975","unstructured":"Stephen C Johnson. 1975. Yacc: Yet another compiler-compiler. Vol. 32. ell Laboratories Murray Hill, NJ."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868281.1868291"},{"key":"e_1_3_2_1_13_1","unstructured":"Kimio Kuramitsu. 2015. Nez open grammar repository. https:\/\/github.com\/nez-peg\/nez-grammar."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2986012.2986019"},{"key":"e_1_3_2_1_15_1","volume-title":"Parsec: Direct style monadic parser combinators for the real world.","author":"Leijen Daan","year":"2002","unstructured":"Daan Leijen and Erik Meijer. 2002. Parsec: Direct style monadic parser combinators for the real world. (2002)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190231"},{"key":"e_1_3_2_1_17_1","unstructured":"Adriaan Moors Frank Piessens and Martin Odersky. 2008. Parser Combinators in Scala."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993548"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660202"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908115"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/509043"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.11.047"},{"key":"e_1_3_2_1_23_1","unstructured":"Don Syme Keith Battocchi et al. 2012. Strongly-typed language support for internet-scale information sources. (2012)."},{"key":"e_1_3_2_1_24_1","unstructured":"Stephan Tolksdorf. 2013. FParsec-a parser combinator library for F#."}],"event":{"name":"SAC '19: The 34th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Limassol Cyprus","acronym":"SAC '19"},"container-title":["Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297280.3297433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297280.3297433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:16Z","timestamp":1750208536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297280.3297433"}},"subtitle":["a typed tree construction from parsing expression grammars with regex-like captures"],"short-title":[],"issued":{"date-parts":[[2019,4,8]]},"references-count":24,"alternative-id":["10.1145\/3297280.3297433","10.1145\/3297280"],"URL":"https:\/\/doi.org\/10.1145\/3297280.3297433","relation":{},"subject":[],"published":{"date-parts":[[2019,4,8]]},"assertion":[{"value":"2019-04-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}