{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:33Z","timestamp":1725663273715},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_165","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:25:03Z","timestamp":1330169103000},"page":"435-442","source":"Crossref","is-referenced-by-count":3,"title":["Exponential optimization for the LLP(k) parsing method"],"prefix":"10.1007","author":[{"given":"Jan","family":"Pittl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"43_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling, Vols. I,II","author":"A. V. Aho","year":"1972","unstructured":"Aho, A.V. and Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vols. I,II, Prentice Hall, Englewood Cliffs, N.J., 1972\u20133."},{"key":"43_CR2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/362619.362625","volume":"14","author":"F. L. deRemer","year":"1971","unstructured":"deRemer, F.L., Simple LR(k) Grammars, CACM, 14 (1971), 453\u2013460","journal-title":"CACM"},{"doi-asserted-by":"crossref","unstructured":"Geller, M.M., Graham, S.L., and Harrison, M.A., Production Prefix Parsing (extended abstract), in Automata, Languages, and Programming, 2nd Colloquium, University of Saarbr\u00fccken (J. Loeckx, ed.), 1974, 232\u2013241.","key":"43_CR3","DOI":"10.1007\/3-540-06841-4_63"},{"doi-asserted-by":"crossref","unstructured":"Geller, M.M., Harrison, M.A., Strict Deterministic Versus LR(O) Parsing, Conference Record of ACM Symposium on Principles of Programming Languages, 1973, 22\u201332.","key":"43_CR4","DOI":"10.1145\/512927.512929"},{"unstructured":"Geller, M.M., Harrison, M.A., Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, Parts I,II, unpublished","key":"43_CR5"},{"key":"43_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","volume":"7","author":"M. A. Harrison","year":"1973","unstructured":"Harrison, M.A. and Havel, I.M., Strict Deterministic Grammars, Journal of Computer and System Sciences, 7 (1973), 237\u2013277.","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1145\/321850.321851","volume":"21","author":"M. A. Harrison","year":"1974","unstructured":"Harrison, M.A. and Havel, I.M., On the Parsing of Deterministic Languages, JACM, 21 (1974), 525\u2013548.","journal-title":"JACM"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-07389-2_182","volume-title":"MFCS '75","author":"J. Kr\u00e1l","year":"1975","unstructured":"Kr\u00e1l, J., Demner, J., Parsing As a Subtask of Compiling, MFCS '75, Lecture Notes in Computer Science 32, Springer-Verlag, Berlin, 1975, 61\u201373."},{"unstructured":"Lomet, D.B., The Construction of Efficient Deterministic Language Processors, Ph.d. diss., University of Pennsylvania, Philadelphia, 1969, and IBM Research Report RC 2738, 1970.","key":"43_CR9"},{"unstructured":"Lomet, D.B., Formal Construction of Multiple Exit Parsing Routines, Report IBM.","key":"43_CR10"},{"doi-asserted-by":"crossref","unstructured":"Lomet, D.B., Automatic Generation of Multiple Exit Parsing Subroutines, in Automata, Languages, and Programming, 2nd Colloquium, University of Saarbr\u00fccken (J. Loeckx, ed.), 1974, 214\u2013231.","key":"43_CR11","DOI":"10.1007\/3-540-06841-4_62"},{"unstructured":"Pittl, J., Characteristic Parsing of LLP(k) Grammars, (in Czech), SVO\u010c Thesis, Prague, 1977.","key":"43_CR12"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_165.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:59:24Z","timestamp":1605625164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_165","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}