{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T21:01:05Z","timestamp":1751662865026},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_7","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:07:42Z","timestamp":1373504862000},"page":"60-71","source":"Crossref","is-referenced-by-count":7,"title":["Two-Pass Greedy Regular Expression Parsing"],"prefix":"10.1007","author":[{"given":"Niels Bj\u00f8rn Bugge","family":"Grathwohl","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Fritz","family":"Henglein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Lasse","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Ulrik Terp","family":"Rasmussen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","reference":[{"unstructured":"Kearns, S.M.: Extending Regular Expressions. PhD thesis, Columbia University (1990)","key":"7_CR1"},{"key":"7_CR2","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)"},{"issue":"2","key":"7_CR3","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 Informatica\u00a037(2), 121\u2013144 (2000)","journal-title":"Acta Informatica"},{"key":"7_CR4","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)"},{"doi-asserted-by":"crossref","unstructured":"Henglein, F., Nielsen, L.: Regular expression containment: Coinductive axiomatization and computational interpretation. In: Proc. 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL). SIGPLAN Notices, vol.\u00a046, pp. 385\u2013398. ACM Press (January 2011)","key":"7_CR5","DOI":"10.1145\/1925844.1926429"},{"unstructured":"Cox, R.: RE2, \n                    \n                      https:\/\/code.google.com\/p\/re2\/","key":"7_CR6"},{"unstructured":"Ousterhout, J.: Tcl: An Embeddable Command Language. In: Proc. USENIX Winter Conference, pp. 133\u2013146 (January 1990)","key":"7_CR7"},{"unstructured":"Wall, L., Christiansen, T., Orwant, J.: Programming Perl. O\u2019Reilly Media, Incorporated (2000)","key":"7_CR8"},{"doi-asserted-by":"crossref","unstructured":"Veanes, M.V.M., de\u00a0Halleux, P., Tillmann, N.: Rex: Symbolic Regular Expression Explorer. In: Proc. 3d Int\u2019l Conf. on Software Testing, Verification and Validation, Paris, France. IEEE Computer Society Press (April 6-10 2010)","key":"7_CR9","DOI":"10.1109\/ICST.2010.15"},{"unstructured":"Cox, R.: Regular Expression Matching can be Simple and Fast","key":"7_CR10"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Earley, J.: An Efficient Context-Free Parsing Algorithm. Communications of the ACM\u00a013(2), 94\u2013102 (1970)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Might, M., Darais, D., Spiewak, D.: Parsing with derivatives: a functional pearl. In: ACM SIGPLAN Notices, vol.\u00a046, pp. 189\u2013195. ACM (2011)","key":"7_CR12","DOI":"10.1145\/2034574.2034801"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1145\/1863543.1863594","volume-title":"Proc. of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010","author":"S. Fischer","year":"2010","unstructured":"Fischer, S., Huch, F., Wilke, T.: A Play on Regular Expressions: Functional Pearl. In: Proc. of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010, pp. 357\u2013368. ACM, New York (2010)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:38:52Z","timestamp":1557945532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}