{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T04:28:38Z","timestamp":1648614518116},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1971,8,1]],"date-time":"1971-08-01T00:00:00Z","timestamp":49852800000},"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":15326,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1971,8]]},"DOI":"10.1016\/s0022-0000(71)80022-3","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T10:37:03Z","timestamp":1199356623000},"page":"337-352","source":"Crossref","is-referenced-by-count":2,"title":["Unilateral context sensitive grammars and left-to-right parsing"],"prefix":"10.1016","volume":"5","author":[{"given":"Gy\u00f6rgy","family":"R\u00e9v\u00e9sz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(71)80022-3_bib1","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":"Information and Control"},{"key":"10.1016\/S0022-0000(71)80022-3_bib2","article-title":"Matematikai grammatik\u00e1k (in Hungarian)","author":"Farkas","year":"1968"},{"key":"10.1016\/S0022-0000(71)80022-3_bib3","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonetik, Sprachwiss. Kommunikat."},{"key":"10.1016\/S0022-0000(71)80022-3_bib4","first-page":"267","article-title":"Syntactic analysis and unilateral context-sensitive grammars","volume":"4","author":"R\u00e9v\u00e9sz","year":"1969","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/S0022-0000(71)80022-3_bib5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linear bounded automata","volume":"7","author":"Kuroda","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(71)80022-3_bib6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0019-9958(68)90722-5","article-title":"Sets accepted by one-way stack automata are context sensitive","volume":"13","author":"Hopcroft","year":"1968","journal-title":"Information and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000071800223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000071800223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T18:25:44Z","timestamp":1546367144000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000071800223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,8]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1971,8]]}},"alternative-id":["S0022000071800223"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(71)80022-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1971,8]]}}}