{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T04:52:13Z","timestamp":1773118333532,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990,1]]},"DOI":"10.1016\/0096-0551(90)90020-p","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"193-204","source":"Crossref","is-referenced-by-count":12,"title":["Incremental recursive descent parsing"],"prefix":"10.1016","volume":"15","author":[{"given":"Arvind M.","family":"Murching","sequence":"first","affiliation":[]},{"given":"Y.V.","family":"Prasad","sequence":"additional","affiliation":[]},{"given":"Y.N.","family":"Srikant","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(90)90020-P_BIB1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF00265676","article-title":"Incremental LR parsers","volume":"10","author":"Celentano","year":"1978","journal-title":"Acta Informatica"},{"key":"10.1016\/0096-0551(90)90020-P_BIB2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF00290733","article-title":"An efficient incremental LR parser for grammars with epsilon productions","volume":"19","author":"Agrawal","year":"1983","journal-title":"Acta Informatica"},{"key":"10.1016\/0096-0551(90)90020-P_BIB3","series-title":"Compilers: Principles, Techniques and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0096-0551(90)90020-P_BIB4","series-title":"Proc. ACM SIGPLAN Symposium on Compiler Construction","first-page":"122","article-title":"Incremental compilation in Magpie","volume":"19","author":"Schwartz","year":"1984"},{"key":"10.1016\/0096-0551(90)90020-P_BIB5","series-title":"Algorithms + Data Structures = Programs","author":"Wirth","year":"1976"},{"key":"10.1016\/0096-0551(90)90020-P_BIB6","series-title":"Syntax of Programming Languages","author":"Backhouse","year":"1979"},{"key":"10.1016\/0096-0551(90)90020-P_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0096-0551(89)90020-9","article-title":"Incremental attribute evaluation through recursive procedures","volume":"14","author":"Murching","year":"1989","journal-title":"Comput. Lang."}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519090020P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519090020P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:24:49Z","timestamp":1552634689000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009605519090020P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["009605519090020P"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(90)90020-p","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}