{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:20:48Z","timestamp":1649082048286},"reference-count":11,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":1062,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1016\/j.entcs.2010.08.032","type":"journal-article","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T09:07:10Z","timestamp":1283936830000},"page":"65-74","source":"Crossref","is-referenced-by-count":0,"title":["TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator"],"prefix":"10.1016","volume":"253","author":[{"given":"John","family":"Boyland","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Spiewak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/j.entcs.2010.08.032_br0010","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/381841.381847","article-title":"Cool: A portable project for teaching compiler construction","volume":"31","author":"Aiken","year":"1996","journal-title":"ACM SIGPLAN Notices"},{"issue":"28","key":"10.1016\/j.entcs.2010.08.032_br0020","first-page":"181","article-title":"Very fast YACC-compatible parsers (for very little effort)","volume":"2","author":"Bhamidipaty","year":"1999","journal-title":"Software Practice and Experience"},{"key":"10.1016\/j.entcs.2010.08.032_br0030","first-page":"170","article-title":"Generalized left corner parsing","author":"Demers","year":"1977"},{"issue":"1","key":"10.1016\/j.entcs.2010.08.032_br0040","article-title":"Recursive ascent-descent parsing","volume":"18","author":"Horspool","year":"1993","journal-title":"Journal of Computer Languages"},{"issue":"4","key":"10.1016\/j.entcs.2010.08.032_br0050","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(88)90061-0","article-title":"On a recursive ascent parser","volume":"29","author":"Kruseman Aretz","year":"1988","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.entcs.2010.08.032_br0060","series-title":"Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics","first-page":"63","article-title":"Non-deterministic recursive ascent parsing","author":"Leermakers","year":"1991"},{"key":"10.1016\/j.entcs.2010.08.032_br0070","unstructured":"Adriaan Moors, Frank Piessens, and Martin Odersky. Parser combinators in Scala. Technical Report CW491, Department of Computer Science, K.U.Leuven, February 2008."},{"issue":"7","key":"10.1016\/j.entcs.2010.08.032_br0080","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/13310.13326","article-title":"Very fast LR parsing","volume":"21","author":"Pennello","year":"1986","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/j.entcs.2010.08.032_br0090","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF00286489","article-title":"Semantics routines and LR(k) parsers","volume":"14","author":"Purdom","year":"1980","journal-title":"Acta Informatica"},{"issue":"8","key":"10.1016\/j.entcs.2010.08.032_br0100","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/47907.47909","article-title":"Recursive ascent: an LR analog to recursive descent","volume":"23","author":"Roberts","year":"1988","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/j.entcs.2010.08.032_br0110","unstructured":"Ronald Veldema. Jade, a recursive ascent LALR(1) parser generator. Technical report, Vrije Universiteit Amsterdam, Netherlands, 2001."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066110001118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066110001118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T04:55:15Z","timestamp":1544244915000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066110001118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":11,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["S1571066110001118"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2010.08.032","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}