{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:02Z","timestamp":1750306742021,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T00:00:00Z","timestamp":1406505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["587327"],"award-info":[{"award-number":["587327"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,28]]},"DOI":"10.1145\/2637647.2637653","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T12:29:52Z","timestamp":1406636992000},"page":"7-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Accelerating parser combinators with macros"],"prefix":"10.1145","author":[{"given":"Eric","family":"B\u00e9guet","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}]},{"given":"Manohar","family":"Jonnalagedda","sequence":"additional","affiliation":[{"name":"EPFL, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2014,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"FastCharSequence: Mimics java 1.6 substring in a charsequence. https:\/\/issues.scala-lang.org\/browse\/SI-7710.  FastCharSequence: Mimics java 1.6 substring in a charsequence. https:\/\/issues.scala-lang.org\/browse\/SI-7710."},{"key":"e_1_3_2_1_2_1","unstructured":"FastParsers: A macro-based parser combinators libraray. https:\/\/github.com\/begeric\/FastParsers\/tree\/experiment.  FastParsers: A macro-based parser combinators libraray. https:\/\/github.com\/begeric\/FastParsers\/tree\/experiment."},{"key":"e_1_3_2_1_3_1","unstructured":"Macros: Blackbox vs whitebox. http:\/\/docs.scala-lang.org\/overviews\/macros\/blackbox-whitebox.html.  Macros: Blackbox vs whitebox. http:\/\/docs.scala-lang.org\/overviews\/macros\/blackbox-whitebox.html."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.15"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2489837.2489840"},{"key":"e_1_3_2_1_6_1","unstructured":"M. Doenitz and A. Myltsev. Parboiled2: A macro-based peg parser generator for scala 2.10+. http:\/\/parboiled2.org\/.  M. Doenitz and A. Myltsev. Parboiled2: A macro-based peg parser generator for scala 2.10+. http:\/\/parboiled2.org\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362007.362035"},{"key":"e_1_3_2_1_8_1","volume-title":"Packrat parsing: a practical linear-time algorithm with backtracking","author":"Ford B.","year":"2002","unstructured":"B. Ford and M. F. Kaashoek . Packrat parsing: a practical linear-time algorithm with backtracking , 2002 . B. Ford and M. F. Kaashoek. Packrat parsing: a practical linear-time algorithm with backtracking, 2002."},{"key":"e_1_3_2_1_9_1","volume-title":"Happy: The parser generator for haskell","author":"Gill A.","year":"2010","unstructured":"A. Gill and S. Marlow . Happy: The parser generator for haskell , 2010 . A. Gill and S. Marlow. Happy: The parser generator for haskell, 2010."},{"key":"e_1_3_2_1_10_1","volume-title":"Yacc: Yet another compiler-compiler. Technical report","author":"Johnson S. C.","year":"1979","unstructured":"S. C. Johnson . Yacc: Yet another compiler-compiler. Technical report , 1979 . S. C. Johnson. Yacc: Yet another compiler-compiler. Technical report, 1979."},{"key":"e_1_3_2_1_11_1","volume-title":"On Staged Parser Combinators for Efficient Data Processing. Technical report","author":"Jonnalagedda M.","year":"2014","unstructured":"M. Jonnalagedda , T. Coppey , S. Stucki , T. Rompf , and M. Odersky . On Staged Parser Combinators for Efficient Data Processing. Technical report , 2014 . M. Jonnalagedda, T. Coppey, S. Stucki, T. Rompf, and M. Odersky. On Staged Parser Combinators for Efficient Data Processing. Technical report, 2014."},{"key":"e_1_3_2_1_12_1","volume-title":"Yin-yang: Transparent deep embedding of dsls","author":"Jovanovic V.","year":"2013","unstructured":"V. Jovanovic , V. Nikolaev , N. D. Pham , V. Ureche , S. Stucki , C. Koch , and M. Odersky . Yin-yang: Transparent deep embedding of dsls , 2013 . V. Jovanovic, V. Nikolaev, N. D. Pham, V. Ureche, S. Stucki, C. Koch, and M. Odersky. Yin-yang: Transparent deep embedding of dsls, 2013."},{"key":"e_1_3_2_1_13_1","first-page":"122","volume-title":"LNCS","author":"Koopman P.","year":"1998","unstructured":"P. Koopman and R. Plasmeijer . Efficient combinator parsers. In In Implementation of Functional Languages , LNCS , pages 122 -- 138 . Springer-Verlag , 1998 . P. Koopman and R. Plasmeijer. Efficient combinator parsers. In In Implementation of Functional Languages, LNCS, pages 122--138. Springer-Verlag, 1998."},{"key":"e_1_3_2_1_14_1","volume-title":"Parsec: Direct style monadic parser combinators for the real world. Technical report","author":"Leijen D.","year":"2001","unstructured":"D. Leijen and E. Meijer . Parsec: Direct style monadic parser combinators for the real world. Technical report , 2001 . D. Leijen and E. Meijer. Parsec: Direct style monadic parser combinators for the real world. Technical report, 2001."},{"key":"e_1_3_2_1_15_1","volume-title":"Parser combinators in scala","author":"Moors A.","year":"2008","unstructured":"A. Moors , F. Piessens , and M. Odersky . Parser combinators in scala , 2008 . A. Moors, F. Piessens, and M. Odersky. Parser combinators in scala, 2008."},{"key":"e_1_3_2_1_16_1","volume-title":"USA","author":"Odersky M.","year":"2008","unstructured":"M. Odersky , L. Spoon , and B. Venners . Programming in Scala: A Comprehensive Step-by-step Guide. Artima Incorporation , USA , 1 st edition, 2008 . M. Odersky, L. Spoon, and B. Venners. Programming in Scala: A Comprehensive Step-by-step Guide. Artima Incorporation, USA, 1st edition, 2008.","edition":"1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250705"},{"key":"e_1_3_2_1_18_1","unstructured":"A. Prokopec. Scalameter: Automate your performance testing today. http:\/\/scalameter.github.io\/.  A. Prokopec. Scalameter: Automate your performance testing today. http:\/\/scalameter.github.io\/."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868294.1868314"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429128"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2012.03.005"},{"key":"e_1_3_2_1_22_1","unstructured":"O. S. Scott Owens Matthew Flatt and B. McMullan. Lexer and parser generators in scheme.  O. S. Scott Owens Matthew Flatt and B. McMullan. Lexer and parser generators in scheme."},{"key":"e_1_3_2_1_23_1","volume-title":"Quasiquotes for Scala. Technical report","author":"Shabalin D.","year":"2013","unstructured":"D. Shabalin , E. Burmako , and M. Odersky . Quasiquotes for Scala. Technical report , 2013 . D. Shabalin, E. Burmako, and M. Odersky. Quasiquotes for Scala. Technical report, 2013."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/215465.215579"},{"key":"e_1_3_2_1_25_1","unstructured":"D. Spiewak. Generalized parser combinators 2010.  D. Spiewak. Generalized parser combinators 2010."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00053-0"},{"key":"e_1_3_2_1_27_1","first-page":"24","volume-title":"Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text","author":"Wadler P.","year":"1995","unstructured":"P. Wadler . Monads for functional programming . In Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text , pages 24 -- 52 , London, UK , UK, 1995 . Springer-Verlag . P. Wadler. Monads for functional programming. In Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text, pages 24--52, London, UK, UK, 1995. Springer-Verlag."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328408.1328424"}],"event":{"name":"ECOOP '14: European Conference on Object-Oriented Programming","sponsor":["Uppsala University, Department of Information Science Uppsala University, Department of Information Science","AITO Assoc Internationale por les Technologies Objects","SIGPLAN ACM Special Interest Group on Programming Languages","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Uppsala Sweden","acronym":"ECOOP '14"},"container-title":["Proceedings of the Fifth Annual Scala Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2637647.2637653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2637647.2637653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:17Z","timestamp":1750231697000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2637647.2637653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,28]]},"references-count":28,"alternative-id":["10.1145\/2637647.2637653","10.1145\/2637647"],"URL":"https:\/\/doi.org\/10.1145\/2637647.2637653","relation":{},"subject":[],"published":{"date-parts":[[2014,7,28]]},"assertion":[{"value":"2014-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}