{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T12:39:57Z","timestamp":1746189597992,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031745577"},{"type":"electronic","value":"9783031745584"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74558-4_6","type":"book-chapter","created":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T04:34:48Z","timestamp":1736397288000},"page":"112-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Context-Free Subphrase Grammars"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1403-2129","authenticated-orcid":false,"given":"Bj\u00f6rn","family":"L\u00f6tters","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,10]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(95)90680-J","volume":"142","author":"A Aasa","year":"1995","unstructured":"Aasa, A.: Precedences in specifications and implementations of programming languages. Theoret. Comput. Sci. 142(1), 3\u201326 (1995). https:\/\/doi.org\/10.1016\/0304-3975(95)90680-J","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR2","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, Principles, Techniques, and Tools, 1 edn. Addison-Wesley, Boston (1986)"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Amorim, L.E.D.S., Steindorfer, M.J., Visser, E.: Deep priority conflicts in the wild: a pilot study. In: Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2017, pp. 55\u201366. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3136014.3136020","DOI":"10.1145\/3136014.3136020"},{"key":"6_CR4","unstructured":"Birkhoff, G.: Lattice Theory. Colloquium Publications, American Mathematical Society (1948)"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N Chomsky","year":"1959","unstructured":"Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(2), 137\u2013167 (1959). https:\/\/doi.org\/10.1016\/S0019-9958(59)90362-6","journal-title":"Inf. Control"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-24452-0_5","volume-title":"Implementation and Application of Functional Languages","author":"NA Danielsson","year":"2011","unstructured":"Danielsson, N.A., Norell, U.: Parsing mixfix operators. In: Scholz, S.-B., Chitil, O. (eds.) IFL 2008. LNCS, vol. 5836, pp. 80\u201399. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24452-0_5"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2 edn. Cambridge University Press, Cambridge (2002). https:\/\/doi.org\/10.1017\/CBO9780511809088","DOI":"10.1017\/CBO9780511809088"},{"key":"6_CR8","unstructured":"Demaille, A., Eggert, P.: Bison. https:\/\/www.gnu.org\/software\/bison\/"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Ern\u00e9, M., Gehrke, M., Pultr, A.: Complete congruences on topologies and down-set lattices. Appl. Categorical Struct. 15, 163\u2013184 (2007). https:\/\/doi.org\/10.1007\/s10485-006-9054-3","DOI":"10.1007\/s10485-006-9054-3"},{"issue":"11","key":"6_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/71605.71607","volume":"24","author":"J Heering","year":"1989","unstructured":"Heering, J., Hendriks, P.R.H., Klint, P., Rekers, J.: The syntax definition formalism SDF-reference manual-. SIGPLAN Not. 24(11), 43\u201375 (1989). https:\/\/doi.org\/10.1145\/71605.71607","journal-title":"SIGPLAN Not."},{"key":"6_CR11","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3 edn. Addison-Wesley, Boston (2006)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2013.09.012","volume":"87","author":"A Johnstone","year":"2014","unstructured":"Johnstone, A., Scott, E., van den Brand, M.: Modular grammar specification. Sci. Comput. Program. 87, 23\u201343 (2014). https:\/\/doi.org\/10.1016\/j.scico.2013.09.012","journal-title":"Sci. Comput. Program."},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Kats, L.C., Visser, E., Wachsmuth, G.: Pure and declarative syntax definition: paradise lost and regained. In: OOPSLA 2010. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1869459.1869535","DOI":"10.1145\/1869459.1869535"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theory 2(2), 127\u2013145 (1968). Correction: 5(1): 95-96 (1971)","DOI":"10.1007\/BF01702865"},{"key":"6_CR15","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D. thesis, Chalmers University of Technology (2007)"},{"key":"6_CR16","unstructured":"Parr, T.: The Definitive ANTLR 4 Reference, 2 edn. Pragmatic Bookshelf (2013)"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1017\/S0956796803004738","volume":"14","author":"A Ranta","year":"2004","unstructured":"Ranta, A.: Grammatical framework. J. Funct. Program. 14(2), 145\u2013189 (2004). https:\/\/doi.org\/10.1017\/S0956796803004738","journal-title":"J. Funct. Program."},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/1146809.1146810","volume":"28","author":"E Scott","year":"2006","unstructured":"Scott, E., Johnstone, A.: Right nulled GLR parsers. ACM Trans. Program. Lang. Syst. 28(4), 577\u2013618 (2006). https:\/\/doi.org\/10.1145\/1146809.1146810","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-58768-0_1","volume-title":"Software Engineering and Formal Methods","author":"LE de Souza Amorim","year":"2020","unstructured":"de Souza Amorim, L.E., Visser, E.: Multi-purpose syntax definition with SDF3. In: de Boer, F., Cerone, A. (eds.) SEFM 2020. LNCS, vol. 12310, pp. 1\u201323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58768-0_1"},{"key":"6_CR20","unstructured":"Tomita, M.: An efficient context-free parsing algorithm for natural languages. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence - Volume 2, IJCAI 1985, pp. 756\u2013764. Morgan Kaufmann Publishers, San Francisco (1985)"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Weaver, N.: Lipschitz Algebras. World Scientific (1999). https:\/\/doi.org\/10.1142\/4100","DOI":"10.1142\/4100"},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1014216630973","volume":"5","author":"S Wintner","year":"2002","unstructured":"Wintner, S.: Modular context-free grammars. Grammars 5(1), 41\u201363 (2002). https:\/\/doi.org\/10.1023\/A:1014216630973","journal-title":"Grammars"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74558-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:03:42Z","timestamp":1736399022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74558-4_6"}},"subtitle":["A Grammar Formalism for Modular Syntax Definitions"],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031745577","9783031745584"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74558-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"10 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that are relevant to the content of this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"South Orange, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}