{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:01Z","timestamp":1725663181603},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_98","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:01:07Z","timestamp":1330189267000},"page":"555-568","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partitioned chain grammars"],"prefix":"10.1007","author":[{"given":"Peter","family":"Schlichtiger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"45_CR1","unstructured":"A.V.Aho, J.D.Ullman: The Theory of Parsing, Translation and Compiling I,II (1972), Prentice Hall, Inc."},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/362619.362625","volume":"14","author":"F. L. DeRemer","year":"1971","unstructured":"F.L. DeRemer: Simple LR(k)-Grammars, CACM 14 (1971), 453\u2013460","journal-title":"CACM"},{"key":"45_CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-09510-1_19","volume":"71","author":"D. Friede","year":"1979","unstructured":"D. Friede: Partitioned LL(k)-Grammars, Lecture Notes in Computer Science 71 (1979), 245\u2013255","journal-title":"Lecture Notes in Computer Science"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"S.Ginsburg,S.A.Greibach: Deterministic Context-Free Languages, Information and Control 9, 620\u2013648","DOI":"10.1016\/S0019-9958(66)80019-0"},{"key":"45_CR5","first-page":"237","volume":"7","author":"M. A. Harrison","year":"1973","unstructured":"M.A. Harrison,I.M. Havel: Strict Deterministic Grammars, JCSS 7 (1973), 237\u2013277","journal-title":"JCSS"},{"key":"45_CR6","unstructured":"O.Mayer: Syntaxanalyse, Bibliographisches Institut Mannheim (1978)"},{"key":"45_CR7","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-08342-1_27","volume":"52","author":"A. Nijholt","year":"1977","unstructured":"A. Nijholt: Simple Chain Grammars, Lecture Notes in Computer Science 52 (1977), 352\u2013364","journal-title":"Lecture Notes in Computer Science"},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/3-540-08860-1_24","volume":"62","author":"A. Nijholt","year":"1978","unstructured":"A. Nijholt: On the Parsing and Covering of Simple Chain Grammars, Lecture Notes in Computer Science 62 (1978), 330\u2013344","journal-title":"Lecture Notes in Computer Science"},{"key":"45_CR9","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0304-3975(79)90032-X","volume":"9","author":"A. Nijholt","year":"1979","unstructured":"A. Nijholt: Simple Chain Grammars and Languages,Theoretical Computer Science 9 (1979), 282\u2013309","journal-title":"Theoretical Computer Science"},{"key":"45_CR10","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/3-540-09510-1_35","volume":"71","author":"A. Nijholt","year":"1979","unstructured":"A. Nijholt: Structure Preserving Transformation on Non-Left-Recursive Grammars, Lecture Notes in Computer Science 71 (1979), 446\u2013459","journal-title":"Lecture Notes in Computer Science"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"D.J.Rosenkrantz,P.M.Lewis II: Deterministic Left Corner Parsing, IEEE Conf. Rec. of the 11'th An. Symp. on Switching and Automata Theory (1970), 139\u2013152","DOI":"10.1109\/SWAT.1970.5"},{"key":"45_CR12","unstructured":"P.Schlichtiger: Kettengrammatiken \u2014 ein Konzept zur Definition handhabbarer Grammatikklassen mit effizientem Analyseverhalten, Doctorial Thesis,University of Kaiserslautern (1979)"},{"key":"45_CR13","unstructured":"P.Schlichtiger: On the Parsing of Partitioned Chain Grammars, Interner Bericht 21\/79 (1979),University of Kaiserslautern"},{"key":"45_CR14","unstructured":"P.Schlichtiger: On How to Construct Efficiently Parsable Grammars, Interner Bericht 22\/80 (1980), University of Kaiserslautern"},{"key":"45_CR15","unstructured":"E.Soisalon-Soininen,E.Ukkonen: A A Characterisation of LL(k)-Languages, Proc. of the 3rd Coll. on Automata, Languages and Programming (1976), 20\u201330"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_98","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:14:43Z","timestamp":1558268083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]},"assertion":[{"value":"24 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}