{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:00Z","timestamp":1759637940378},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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":7563,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0167-6423(92)90007-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"171-196","source":"Crossref","is-referenced-by-count":4,"title":["LR-parsing derived"],"prefix":"10.1016","volume":"19","author":[{"given":"Wim H.","family":"Hesselink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(92)90007-X_BIB1","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0167-6423(92)90007-X_BIB2","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(92)90007-X_BIB3","series-title":"Predicate Calculus and Program Semantics","author":"Dijkstra","year":"1990"},{"key":"10.1016\/0167-6423(92)90007-X_BIB4","article-title":"A simplification of Earley's algorithm","author":"Doornbos","year":"1991","journal-title":"Computing Science Notes CS 9102"},{"key":"10.1016\/0167-6423(92)90007-X_BIB5","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\/0167-6423(92)90007-X_BIB6","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0167-6423(92)90007-X_BIB7","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","article-title":"On the translation of languages from left to right","volume":"8","author":"Knuth","year":"1965","journal-title":"Inform. Control"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290007X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290007X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:54:56Z","timestamp":1555091696000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239290007X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["016764239290007X"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(92)90007-x","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}