{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:44:28Z","timestamp":1648561468690},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1984,11,1]],"date-time":"1984-11-01T00:00:00Z","timestamp":468115200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1984,11]]},"DOI":"10.1016\/0020-0190(84)90081-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"181-185","source":"Crossref","is-referenced-by-count":1,"title":["How to produce all sentences from a two-level grammar"],"prefix":"10.1016","volume":"19","author":[{"given":"Dick","family":"Grune","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90081-4_BIB1_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00265077","volume":"5","year":"1975","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(84)90081-4_BIB1_2","series-title":"MC Tract 50","year":"1976"},{"issue":"5","key":"10.1016\/0020-0190(84)90081-4_BIB1_3","first-page":"5","volume":"12","year":"1977","journal-title":"Sigplan Notices"},{"key":"10.1016\/0020-0190(84)90081-4_BIB2","series-title":"Grammars for Programming Languages","author":"Cleaveland","year":"1977"},{"key":"10.1016\/0020-0190(84)90081-4_BIB3","series-title":"Automata, Languages and Programming","article-title":"The generative power of two-level grammars","volume":"14","author":"Wijngaarden van","year":"1974"},{"key":"10.1016\/0020-0190(84)90081-4_BIB4","series-title":"The C Programming Language","author":"Kernighan","year":"1978"},{"key":"10.1016\/0020-0190(84)90081-4_BIB5","series-title":"Proc. IFIP\/TC2\/WG2.1 Working Conference on the Relations between Numerical Computation and Programming Languages, Boulder","article-title":"Languageless Programming","author":"Wijngaarden","year":"1981"},{"issue":"2","key":"10.1016\/0020-0190(84)90081-4_BIB6","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"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900814?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900814?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:58:37Z","timestamp":1555073917000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084900814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,11]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1984,11]]}},"alternative-id":["0020019084900814"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90081-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,11]]}}}