{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T07:49:36Z","timestamp":1680076176495},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0096-0551(93)90027-x","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:04:53Z","timestamp":1060283093000},"page":"1-15","source":"Crossref","is-referenced-by-count":4,"title":["Recursive ascent-descent parsing"],"prefix":"10.1016","volume":"18","author":[{"given":"R","family":"Nigel Horspool","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(93)90027-X_BIB1","series-title":"Proc. 4th ACM Symposium on Principles of Programming Languages","first-page":"170","article-title":"Generalized Left Corner Parsing","author":"Demers","year":"1977"},{"key":"10.1016\/0096-0551(93)90027-X_BIB2","first-page":"453","article-title":"Simple LR(k) Grammars","volume":"14,7","author":"DeRemer","year":"1971","journal-title":"Commun. Ass. Comput. Mach."},{"key":"10.1016\/0096-0551(93)90027-X_BIB3","series-title":"Compilers: Principles, Techniques and Tools","author":"Aho","year":"1985"},{"issue":"8","key":"10.1016\/0096-0551(93)90027-X_BIB4","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":"Ass. Comput. Mach. SIGPLAN Notices"},{"issue":"5","key":"10.1016\/0096-0551(93)90027-X_BIB5","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":"1990","journal-title":"Inf. Processing Lett."},{"issue":"3","key":"10.1016\/0096-0551(93)90027-X_BIB6","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":"Aretz","year":"1988","journal-title":"Inf. Processing Lett."},{"key":"10.1016\/0096-0551(93)90027-X_BIB7","series-title":"LR Parsing: Theory and Practice","author":"Chapman","year":"1987"},{"key":"10.1016\/0096-0551(93)90027-X_BIB8","series-title":"Crafting A Compiler","author":"Fischer","year":"1988"},{"key":"10.1016\/0096-0551(93)90027-X_BIB9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF00286489","article-title":"Semantic Routines and LR(k) Parsers","volume":"14","author":"Purdom","year":"1980","journal-title":"Acta Information"},{"issue":"4","key":"10.1016\/0096-0551(93)90027-X_BIB10","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1145\/322344.322350","article-title":"On the Relationship Between LL(1) and LR(1) Grammars","volume":"29","author":"Beatty","year":"1982","journal-title":"J. Ass. Comput. Mach."},{"issue":"2","key":"10.1016\/0096-0551(93)90027-X_BIB11","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":"6","key":"10.1016\/0096-0551(93)90027-X_BIB12","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/spe.4380200602","article-title":"Even Faster LR Parsing","volume":"20","author":"Horspool","year":"1990","journal-title":"Software\u2014Practice & Experience"},{"key":"10.1016\/0096-0551(93)90027-X_BIB13","series-title":"Proc. 1986 Symposium on Compiler Construction","first-page":"145","article-title":"Very Fast LR Parsing","volume":"21","author":"Pennello","year":"1986"},{"key":"10.1016\/0096-0551(93)90027-X_BIB14","series-title":"The Art of Prolog.","author":"Sterling","year":"1986"},{"key":"10.1016\/0096-0551(93)90027-X_BIB15","article-title":"YACC\u2014Yet Another Compiler Compiler","volume":"2B","author":"Johnson","year":"1979"},{"issue":"2","key":"10.1016\/0096-0551(93)90027-X_BIB16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00263989","article-title":"Methods for the Automatic Construction of Error Correcting Parsers","volume":"13","author":"R\u00f6hrich","year":"1980","journal-title":"Acta Informatica"},{"key":"10.1016\/0096-0551(93)90027-X_BIB17","author":"Aho","year":"1972"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519390027X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519390027X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:25:51Z","timestamp":1552620351000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009605519390027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["009605519390027X"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(93)90027-x","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}