{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:29Z","timestamp":1725664649400},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602460"},{"type":"electronic","value":"9783540447689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60246-1_139","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:55:51Z","timestamp":1330278951000},"page":"326-336","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic parsing for augmented context-free grammars"],"prefix":"10.1007","author":[{"given":"Luca","family":"Breveglieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Cherubini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano Crespi","family":"Reghizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"31_CR1","first-page":"162","volume":"324","author":"E. Allevi","year":"1988","unstructured":"E. Allevi, A. Cherubini, S. Crespi Reghizzi, \u201cBreadth-first Phrase-Structure Grammars and Queue Automata\u201d, in LNCS 324, 1988, pp. 162\u2013170","journal-title":"LNCS"},{"key":"31_CR2","first-page":"61","volume":"226","author":"F. Brandenburg","year":"1981","unstructured":"F. Brandenburg, \u201cOn the Intersections of Stacks and Queues\u201d, in Theoretical Computer Science 226, 1981, pp. 61\u201368","journal-title":"Theoretical Computer Science"},{"key":"31_CR3","first-page":"146","volume":"529","author":"L. Breveglieri","year":"1991","unstructured":"L. Breveglieri, C. Citrini, S. Crespi Reghizzi, \u201cDeterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars\u201d, in LNCS 529, 1991, pp. 146\u2013156","journal-title":"LNCS"},{"key":"31_CR4","unstructured":"L. Breveglieri, A. Cherubini, S. Crespi Reghizzi, \u201cA Chomsky-Sch\u00fctzenberger Property for generalised (augmented) Context-free Languages\u201d, Internal Report n. 93-062, Dipartimento di Elettrnonica e Informazione, Politecnico di Milano, 1994"},{"key":"31_CR5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(91)90053-5","volume":"85","author":"A. Cherubini","year":"1991","unstructured":"A. Cherubini, C. Citrini, S. Crespi Reghizzi, D. Mandrioli, \u201cQRT FIFO Automata, Breadth-first Grammars and their Relations\u201d, in Theoretical Computer Science 85, 1991, pp. 171\u2013203","journal-title":"Theoretical Computer Science"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"A. Cherubini, P. San Pietro, \u201cPolynomial Time Parsing Algorithm for k-Depth Languages\u201d, to appear in Journal of Computer and Systems Science, 1995","DOI":"10.1006\/jcss.1996.0006"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(80)90047-X","volume":"11","author":"B. F. Zannettacci","year":"1980","unstructured":"B. Franchi Zannettacci, B. Vauquelin, \u201cAutomates \u00e0 File\u201d (in French) (Queue Automata), in Theoretical Computer Science 11, 1980, pp. 221\u2013225","journal-title":"Theoretical Computer Science"},{"key":"31_CR8","unstructured":"Y. Guan, G. Hotz, A. Reichert, \u201cTree Grammars with multilinear Interpretation\u201d, Technical Report, University of Saarbr\u00fccken, 1992"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"G. Hotz, G. Pitsch, \u201cOn Parsing Coupled Context-free Languages\u201d, submitted for publication, 1994","DOI":"10.1007\/3-540-60246-1_141"},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A. K. Joshi","year":"1975","unstructured":"A. K. Joshi, L. S. Levi, M. Takahashi, \u201cTree adjunct Grammars\u201d, in Journal on Computer Systems Science 10, 1975, pp. 136\u2013173","journal-title":"Journal on Computer Systems Science"},{"key":"31_CR11","first-page":"464","volume":"15","author":"P. M. Lewis II","year":"1968","unstructured":"P. M. II Lewis, R. E. Stearns, \u201cSyntax-directed Transduction\u201d, in Journal of ACM 15, 1968, pp. 464\u2013488","journal-title":"Journal of ACM"},{"issue":"6","key":"31_CR12","first-page":"389","volume":"29","author":"G. Pitsch","year":"1993","unstructured":"G. Pitsch, \u201cLL(k) Coupled Context-free Grammars\u201d, in Journal on Information and Processing Cybernetics, EIK 29, 6, 1993, pp. 389\u2013413","journal-title":"Journal on Information and Processing Cybernetics, EIK"},{"issue":"2","key":"31_CR13","first-page":"173","volume":"20","author":"G. Satta","year":"1994","unstructured":"G. Satta, \u201cTree-adjoining Grammar Parsing and Matrix Multiplication\u201d, in Computational Linguistics, 20, 2, 1994, pp. 173\u2013191","journal-title":"Computational Linguistics"},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. V. Shanker","year":"1994","unstructured":"K. Vijay Shanker, D. J. Weir, \u201cThe Equivalence of four Extensions of Context-free Grammars\u201d, in Mathematical Systems Theory 27, 1994, pp. 511\u2013546","journal-title":"Mathematical Systems Theory"},{"issue":"10","key":"31_CR15","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/355598.362773","volume":"13","author":"W. A. Woods","year":"1970","unstructured":"W. A. Woods, \u201cTransition Network Grammars for natural Language Analysis\u201d, in Communications of ACM, 13, 10, 1970, pp. 591\u2013606","journal-title":"Communications of ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60246-1_139.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:33:14Z","timestamp":1640943194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60246-1_139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602460","9783540447689"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60246-1_139","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}