{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:04:58Z","timestamp":1762459498727,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319614694"},{"type":"electronic","value":"9783319614700"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-61470-0_7","type":"book-chapter","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T09:54:59Z","timestamp":1497952499000},"page":"106-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars"],"prefix":"10.1007","author":[{"given":"Frank","family":"Drewes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Minas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(86)90070-3","volume":"13","author":"I Aalbersberg","year":"1986","unstructured":"Aalbersberg, I., Ehrenfeucht, A., Rozenberg, G.: On the membership problem for regular DNLC grammars. Discrete Appl. Math. 13, 79\u201385 (1986)","journal-title":"Discrete Appl. Math."},{"key":"7_CR2","unstructured":"Chiang, D., Andreas, J., Bauer, D., Hermann, K.M., Jones, B., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceedings of the 51st Annual Meeting of the Association for Computational Linguistic. Long Papers, vol. 1, pp. 924\u2013932 (2013)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/32.637392","volume":"23","author":"G Costagliola","year":"1997","unstructured":"Costagliola, G., De Lucia, A., Orefice, S., Tortora, G.: A parsing methodology for the implementation of visual systems. IEEE Trans. Softw. Eng. 23, 777\u2013799 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"7","key":"7_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/362619.362625","volume":"14","author":"FL DeRemer","year":"1971","unstructured":"DeRemer, F.L.: Simple LR(k) grammars. Commun. ACM 14(7), 453\u2013460 (1971)","journal-title":"Commun. ACM"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(93)90065-2","volume":"109","author":"F Drewes","year":"1993","unstructured":"Drewes, F.: Recognising $$k$$-connected hypergraphs in cubic time. Theor. Comput. Sci. 109, 83\u2013122 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00236-015-0223-4","volume":"52","author":"F Drewes","year":"2015","unstructured":"Drewes, F., Hoffmann, B.: Contextual hyperedge replacement. Acta Informatica 52, 497\u2013524 (2015)","journal-title":"Acta Informatica"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-34176-2_16","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"F Drewes","year":"2012","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Contextual hyperedge replacement. In: Sch\u00fcrr, A., Varr\u00f3, D., Varr\u00f3, G. (eds.) AGTIVE 2011. LNCS, vol. 7233, pp. 182\u2013197. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34176-2_16"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-21145-9_2","volume-title":"Graph Transformation","author":"F Drewes","year":"2015","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Predictive top-down parsing for hyperedge replacement grammars. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 19\u201334. Springer, Cham (2015). doi:10.1007\/978-3-319-21145-9_2"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-50230-4_9","volume-title":"Software Technologies: Applications and Foundations","author":"F Drewes","year":"2016","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Approximating Parikh images for generating deterministic graph parsers. In: Milazzo, P., Varr\u00f3, D., Wimmer, M. (eds.) STAF 2016. LNCS, vol. 9946, pp. 112\u2013128. Springer, Cham (2016). doi:10.1007\/978-3-319-50230-4_9"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00289155","volume":"10","author":"R Franck","year":"1978","unstructured":"Franck, R.: A class of linearly parsable graph grammars. Acta Informatica 10(2), 175\u2013201 (1978)","journal-title":"Acta Informatica"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992). doi:10.1007\/BFb0013875","DOI":"10.1007\/BFb0013875"},{"key":"7_CR12","unstructured":"Hoffmann, B.: Cleaned SLL(1) grammars are SLR(1). Technical Report 17\u20131, Studiengang Informatik, Universit\u00e4t Bremen (2017). http:\/\/www.informatik.uni-bremen.de\/~hof\/papers\/sllr.pdf"},{"key":"7_CR13","unstructured":"Johnson, S.C.: Yacc: Yet another compiler-compiler. Computer Science Technical Report 32, AT&T Bell Laboratories (1975)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-18771-5_62","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"M Kaul","year":"1987","unstructured":"Kaul, M.: Practical applications of precedence graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 326\u2013342. Springer, Heidelberg (1987). doi:10.1007\/3-540-18771-5_62"},{"issue":"6","key":"7_CR15","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"DE Knuth","year":"1965","unstructured":"Knuth, D.E.: On the translation of languages from left to right. Inf. Control 8(6), 607\u2013639 (1965)","journal-title":"Inf. Control"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00289017","volume":"27","author":"C Lautemann","year":"1990","unstructured":"Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Informatica 27, 399\u2013421 (1990)","journal-title":"Acta Informatica"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/321466.321477","volume":"15","author":"PM Lewis II","year":"1968","unstructured":"Lewis II, P.M., Stearns, R.E.: Syntax-directed transduction. J. ACM 15(3), 465\u2013488 (1968)","journal-title":"J. ACM"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Ludwigs, H.J.: A LR-like analyzer algorithm for graphs. In: Wilhelm, R. (ed.) GI - 10. Jahrestagung, Proceedings of the Saarbr\u00fccken, 30 September - 2 Oktober 1980. Informatik-Fachberichte, vol. 33, pp. 321\u2013335 (1980)","DOI":"10.1007\/978-3-642-67838-7_29"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Minas, M.: Diagram editing with hypergraph parser support. In: Proceedings of the 1997 IEEE Symposium on Visual Languages (VL 1997), Capri, Italy, pp. 226\u2013233 (1997)","DOI":"10.1109\/VL.1997.626587"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Sippu, S., Soisalon-Soininen, E.: Parsing Theroy I: Languages and Parsing, EATCS Monographs in Theoretical Computer Science, vol. 15 (1988)","DOI":"10.1007\/978-3-642-61345-6"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/BFb0017421","volume-title":"Graph Grammars and Their Application to Computer Science","author":"W Vogler","year":"1991","unstructured":"Vogler, W.: Recognizing edge replacement graph languages in cubic time. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 676\u2013687. Springer, Heidelberg (1991). doi:10.1007\/BFb0017421"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61470-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T20:15:15Z","timestamp":1750364115000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-61470-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319614694","9783319614700"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61470-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"21 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}