{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:51:00Z","timestamp":1767984660565,"version":"3.49.0"},"reference-count":15,"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)90127-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"299-312","source":"Crossref","is-referenced-by-count":8,"title":["Recursive ascent parsing: from Earley to Marcus"],"prefix":"10.1016","volume":"104","author":[{"given":"Ren\u00e9","family":"Leermakers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(92)90127-2_BIB1","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."},{"issue":"2","key":"10.1016\/0304-3975(92)90127-2_BIB2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","article-title":"An efficient context-free parsing algorithm","volume":"13","author":"Earley","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90127-2_BIB3","first-page":"1","article-title":"Recursive ascent\u2014descent parsers","volume":"Vol. 477","author":"Horspool","year":"1991"},{"key":"10.1016\/0304-3975(92)90127-2_BIB4","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)90127-2_BIB5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.3115\/977180.977192","article-title":"Non-deterministic recursive ascent parsing","author":"Leermakers","year":"1991","journal-title":"Proc. 5th Conf. of the European Chapter of the Association for Computational Linguistics"},{"key":"10.1016\/0304-3975(92)90127-2_BIB6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(92)90260-3","article-title":"A recursive ascent Earley parser","volume":"41","author":"Leermakers","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90127-2_BIB7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0304-3975(92)90128-3","article-title":"A functional LR parser","volume":"104","author":"Leermakers","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90127-2_BIB8","series-title":"A Theory of Syntactic Recognition of Natural Language","author":"Marcus","year":"1980"},{"key":"10.1016\/0304-3975(92)90127-2_BIB9","series-title":"COLING '86","first-page":"533","article-title":"On formalizations of Marcus' parser","author":"Nozohoor-Farshi","year":"1986"},{"issue":"7","key":"10.1016\/0304-3975(92)90127-2_BIB10","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)90127-2_BIB11","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)90127-2_BIB12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0190(89)90054-9","article-title":"Another note on recursive ascent","volume":"32","author":"Roberts","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/0304-3975(92)90127-2_BIB13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/987481.987489","article-title":"From recursive ascent to recursive descent via compiler optimizations","volume":"25","author":"Roberts","year":"1990","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(92)90127-2_BIB14","first-page":"265","volume":"Vol. II","author":"Sippu","year":"1990"},{"key":"10.1016\/0304-3975(92)90127-2_BIB15","series-title":"A Fast Algorithm for Practical Systems","article-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:0304397592901272?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901272?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:20:30Z","timestamp":1555129230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0304397592901272"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90127-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}