{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:49Z","timestamp":1760202469354,"version":"3.44.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":13346,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100006751","name":"U.S. Army","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006751","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DCR-73-21939"],"award-info":[{"award-number":["DCR-73-21939"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1977]]},"DOI":"10.1016\/0304-3975(77)90033-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"143-153","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["Economy of description by parsers, DPDA's, and PDA's"],"prefix":"10.1016","volume":"4","author":[{"given":"Matthew M.","family":"Geller","sequence":"first","affiliation":[]},{"suffix":"III","given":"Harry B.","family":"Hunt","sequence":"additional","affiliation":[]},{"given":"Thomas G.","family":"Szymanski","sequence":"additional","affiliation":[]},{"given":"Jeffrey D.","family":"Ullman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"volume":"Vols. I and II","year":"1972","author":"Aho","key":"10.1016\/0304-3975(77)90033-0_BIB1"},{"key":"10.1016\/0304-3975(77)90033-0_BIB2","series-title":"Ph.D. Thesis","article-title":"Compact parsers for deterministic languages","author":"Geller","year":"1975"},{"key":"10.1016\/0304-3975(77)90033-0_BIB3","first-page":"22","article-title":"Strict deterministic versus LR(0) parsing","author":"Geller","year":"1973","journal-title":"Conf. Record ACM Symp. Principles of Programming Languages"},{"key":"10.1016\/0304-3975(77)90033-0_BIB4","first-page":"232","article-title":"Production prefix parsing","author":"Geller","year":"1974","journal-title":"Second Colloq. Automata, Languages and Programming"},{"year":"1966","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","key":"10.1016\/0304-3975(77)90033-0_BIB5"},{"issue":"11","key":"10.1016\/0304-3975(77)90033-0_BIB6","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1145\/361219.361223","article-title":"Practical syntactic error recovery","volume":"18","author":"Graham","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(77)90033-0_BIB7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","article-title":"Strict deterministic grammars","volume":"7","author":"Harrison","year":"1973","journal-title":"J. Comput. System Sci"},{"year":"1969","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","key":"10.1016\/0304-3975(77)90033-0_BIB8"},{"key":"10.1016\/0304-3975(77)90033-0_BIB9","first-page":"191","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1966","journal-title":"IEEE Conf. Record 6th Ann. Symp. Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0304-3975(77)90033-0_BIB10","first-page":"188","article-title":"Economy of description by automata, grammars, and formal systems","author":"Meyer","year":"1971","journal-title":"Conf. Record 1971 Ann. Symp. Switching and Automata Theory"},{"key":"10.1016\/0304-3975(77)90033-0_BIB11","first-page":"31","article-title":"Intercalation theorems for stack languages","author":"Ogden","year":"1969","journal-title":"Proc. ACM Symp. Theory of Computing"},{"issue":"3","key":"10.1016\/0304-3975(77)90033-0_BIB12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0019-9958(67)90591-8","article-title":"A regularity test for pushdown machines","volume":"11","author":"Stearns","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(77)90033-0_BIB13","series-title":"TR 70","article-title":"A succinctness result for descriptions of deterministic languages","author":"Valiant","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397577900330?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397577900330?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:27Z","timestamp":1757477907000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397577900330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977]]}},"alternative-id":["0304397577900330"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(77)90033-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1977]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Economy of description by parsers, DPDA's, and PDA's","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(77)90033-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1977 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}