{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T04:39:41Z","timestamp":1648787981523},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0304-3975(92)90128-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"313-323","source":"Crossref","is-referenced-by-count":3,"title":["A functional LR parser"],"prefix":"10.1016","volume":"104","author":[{"given":"Ren\u00e9","family":"Leermakers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lex","family":"Augusteijn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frans E.J.","family":"Kruseman Aretz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90128-3_BIB1","series-title":"The Theory of Parsing, Translation, and Compiling","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(92)90128-3_BIB2","series-title":"Principles of Compiler Design","author":"Aho","year":"1977"},{"issue":"2","key":"10.1016\/0304-3975(92)90128-3_BIB3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0096-0551(88)90010-0","article-title":"SL parses the LR languages","volume":"13","author":"Barnard","year":"1988","journal-title":"Comput. Lang."},{"key":"10.1016\/0304-3975(92)90128-3_BIB4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3115\/981623.981641","article-title":"The structure of shared forests in ambiguous parsing","author":"Billot","year":"1989","journal-title":"Proc. 27th Meeting of the Association for Computational Linguistics"},{"key":"10.1016\/0304-3975(92)90128-3_BIB5","first-page":"129","article-title":"Lazy memo-functions","volume":"Vol. 201","author":"Hughes","year":"1985"},{"key":"10.1016\/0304-3975(92)90128-3_BIB6","first-page":"193","article-title":"Analysis of Tomita's algorithm for general context-free parsing","author":"Kipps","year":"1989","journal-title":"Proc. 1st International Workshop on Parsing Technologies"},{"key":"10.1016\/0304-3975(92)90128-3_BIB7","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":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90128-3_BIB8","first-page":"91","article-title":"Techniques for automatic memoization with applications to context-free parsing","volume":"17","author":"Norvig","year":"1991","journal-title":"Comput. Linguist."},{"issue":"7","key":"10.1016\/0304-3975(92)90128-3_BIB9","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":"SIGPLAN Notices"},{"issue":"8","key":"10.1016\/0304-3975(92)90128-3_BIB10","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":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(92)90128-3_BIB11_1","first-page":"71","article-title":"Observations on context free parsing","author":"Sheil","year":"1976","journal-title":"Statistical Methods in Linguistics"},{"key":"10.1016\/0304-3975(92)90128-3_BIB11_2","unstructured":"b Tech. Report TR 12\u201376, Center for Research in Computing Technology, Aiken Computation Laboratory, Harvard University, Cambridge, MA."},{"key":"10.1016\/0304-3975(92)90128-3_BIB12","series-title":"Efficient Parsing for Natural Language","author":"Tomita","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:57:42Z","timestamp":1555063062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0304397592901283"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90128-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}