{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T09:38:51Z","timestamp":1787564331902,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319071503","type":"print"},{"value":"9783319071510","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07151-0_13","type":"book-chapter","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T23:30:14Z","timestamp":1400715014000},"page":"203-220","source":"Crossref","is-referenced-by-count":18,"title":["POSIX Regular Expression Parsing with Derivatives"],"prefix":"10.1007","author":[{"given":"Martin","family":"Sulzmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenny Zhuo Ming","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM\u00a011(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"13_CR2","unstructured":"Cox, R.: re2 \u2013 an efficient, principled regular expression library, http:\/\/code.google.com\/p\/re2\/+"},{"key":"13_CR3","unstructured":"Cox, R.: NFA POSIX (2007), http:\/\/swtch.com\/~rsc\/regexp\/nfa-posix.y.txt"},{"key":"13_CR4","unstructured":"Cox, R.: Regular expression matching: the virtual machine approach - digression: Posix submatching (2009), http:\/\/swtch.com\/~rsc\/regexp\/regexp2.html"},{"key":"13_CR5","unstructured":"Cox, R.: Regular expression matching in the wild (2010), http:\/\/swtch.com\/~rsc\/regexp\/regexp3.html"},{"key":"13_CR6","unstructured":"http:\/\/hackage.haskell.org\/package\/dequeue-0.1.5\/docs\/Data-Dequeue.html"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s002360000037","volume":"37","author":"D. Dub\u00e9","year":"2000","unstructured":"Dub\u00e9, D., Feeley, M.: Efficiently building a parse tree from a regular expression. Acta Inf.\u00a037(2), 121\u2013144 (2000)","journal-title":"Acta Inf."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-27836-8_53","volume-title":"Automata, Languages and Programming","author":"A. Frisch","year":"2004","unstructured":"Frisch, A., Cardelli, L.: Greedy regular expression matching. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 618\u2013629. Springer, Heidelberg (2004)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-642-39274-0_7","volume-title":"CIAA 2013","author":"N.B.B. Grathwohl","year":"2013","unstructured":"Grathwohl, N.B.B., Henglein, F., Nielsen, L., Rasmussen, U.T.: Two-pass greedy regular expression parsing. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol.\u00a07982, pp. 60\u201371. Springer, Heidelberg (2013)"},{"key":"13_CR10","unstructured":"Institute of Electrical and Electronics Engineers (IEEE): Standard for information technology \u2013 Portable Operating System Interface (POSIX) \u2013 Part 2 (Shell and utilities), Section 2.8 (Regular expression notation). IEEE Standard 1003.2, New York (1992)"},{"key":"13_CR11","unstructured":"Kuklewicz, C.: Regex POSIX, http:\/\/www.haskell.org\/haskellwiki\/Regex_Posix"},{"key":"13_CR12","unstructured":"Kuklewicz, C.: The regex-posix-unittest package, http:\/\/hackage.haskell.org\/package\/regex-posix-unittest"},{"key":"13_CR13","unstructured":"Kuklewicz, C.: Forward regular expression matching with bounded space (2007), http:\/\/haskell.org\/haskellwiki\/RegexpDesign"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Laurikari, V.: NFAs with tagged transitions, their conversion to deterministic automata and application to regular expressions. In: SPIRE, pp. 181\u2013187 (2000)","DOI":"10.1109\/SPIRE.2000.878194"},{"key":"13_CR15","unstructured":"Lu, K.Z.M., Sulzmann, M.: POSIX Submatching with Regular Expression Derivatives, http:\/\/code.google.com\/p\/xhaskell-regex-deriv"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Might, M., Darais, D., Spiewak, D.: Parsing with derivatives: a functional pearl. In: Proc. of ICFP 2011, pp. 189\u2013195. ACM (2011)","DOI":"10.1145\/2034574.2034801"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-642-21254-3_32","volume-title":"Language and Automata Theory and Applications","author":"L. Nielsen","year":"2011","unstructured":"Nielsen, L., Henglein, F.: Bit-coded regular expression parsing. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 402\u2013413. Springer, Heidelberg (2011)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely functional data structures. Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511530104"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-18098-9_25","volume-title":"Implementation and Application of Automata","author":"S. Okui","year":"2011","unstructured":"Okui, S., Suzuki, T.: Disambiguation in regular expression matching via position automata with augmented transitions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 231\u2013240. Springer, Heidelberg (2011)"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S. Owens","year":"2009","unstructured":"Owens, S., Reppy, J., Turon, A.: Regular-expression derivatives reexamined. Journal of Functional Programming\u00a019(2), 173\u2013190 (2009)","journal-title":"Journal of Functional Programming"},{"key":"13_CR21","unstructured":"PCRE - Perl Compatible Regular Expressions, http:\/\/www.pcre.org\/"},{"key":"13_CR22","unstructured":"regex-posix: The posix regex backend for regex-base, http:\/\/hackage.haskell.org\/package\/regex-posix"},{"key":"13_CR23","unstructured":"regex-tdfa: A new all haskell tagged dfa regex engine, inspired by libtre, http:\/\/hackage.haskell.org\/package\/regex-tdfa"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Sulzmann, M., Lu, K.Z.M.: Regular expression sub-matching using partial derivatives. In: Proc. of PPDP 2012, pp. 79\u201390. ACM (2012)","DOI":"10.1145\/2370776.2370788"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/1133651.1133652","volume":"28","author":"S. Vansummeren","year":"2006","unstructured":"Vansummeren, S.: Type inference for unique pattern matching. ACM TOPLAS\u00a028(3), 389\u2013428 (2006)","journal-title":"ACM TOPLAS"},{"key":"13_CR26","unstructured":"Vouillon, J.: ocaml-re - Pure OCaml regular expressions, with support for Perl and POSIX-style strings, https:\/\/github.com\/avsm\/ocaml-re"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07151-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T20:33:08Z","timestamp":1746217988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07151-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319071503","9783319071510"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07151-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}