ResearchSpace

Formalising boost POSIX regular expression matching

Show simple item record

dc.contributor.author Berglund, Martin
dc.contributor.author Bester, W
dc.contributor.author van der Merwe, B
dc.date.accessioned 2019-04-10T10:52:44Z
dc.date.available 2019-04-10T10:52:44Z
dc.date.issued 2018-10
dc.identifier.citation Berglund M., Bester W., van der Merwe B. (2018) Formalising Boost POSIX Regular Expression Matching. In: Fischer B., Uustalu T. (eds) Theoretical Aspects of Computing – ICTAC 2018. ICTAC 2018. Lecture Notes in Computer Science, vol 11187. Springer, Cham en_US
dc.identifier.isbn 978-3-030-02507-6
dc.identifier.isbn 978-3-030-02508-3
dc.identifier.uri https://link.springer.com/chapter/10.1007/978-3-030-02508-3_6
dc.identifier.uri https://link.springer.com/book/10.1007%2F978-3-030-02508-3
dc.identifier.uri http://hdl.handle.net/10204/10936
dc.description Copyright: 2018 Springer, Cham. Due to copyright restrictions, the attached PDF file only contains the abstract version of the full-text item. For access to the full-text item, please consult the publisher's website. The definitive version of the work is published in Theoretical Aspects of Computing – ICTAC 2018 en_US
dc.description.abstract Whereas Perl-compatible regular expression matchers typically exhibit some variation of leftmost-greedy semantics, those conforming to the posix standard are prescribed leftmost-longest semantics. However, the posix standard leaves some room for interpretation, and Fowler and Kuklewicz have done experimental work to confirm differences between various posix matchers. The Boost library has an interesting take on the posix standard, where it maximises the leftmost match not with respect to subexpressions of the regular expression pattern, but rather, with respect to capturing groups. In our work, we provide the first formalisation of Boost semantics, and we analyse the complexity of regular expression matching when using Boost semantics. en_US
dc.language.iso en en_US
dc.publisher Springer Cham en_US
dc.relation.ispartofseries Workflow;22167
dc.subject Boost en_US
dc.subject POSIX en_US
dc.subject Regular expression matching en_US
dc.title Formalising boost POSIX regular expression matching en_US
dc.type Book Chapter en_US
dc.identifier.apacitation Berglund, M., Bester, W., & van der Merwe, B. (2018). Formalising boost POSIX regular expression matching., <i>Workflow;22167</i> Springer Cham. http://hdl.handle.net/10204/10936 en_ZA
dc.identifier.chicagocitation Berglund, Martin, W Bester, and B van der Merwe. "Formalising boost POSIX regular expression matching" In <i>WORKFLOW;22167</i>, n.p.: Springer Cham. 2018. http://hdl.handle.net/10204/10936. en_ZA
dc.identifier.vancouvercitation Berglund M, Bester W, van der Merwe B. Formalising boost POSIX regular expression matching.. Workflow;22167. [place unknown]: Springer Cham; 2018. [cited yyyy month dd]. http://hdl.handle.net/10204/10936. en_ZA
dc.identifier.ris TY - Book Chapter AU - Berglund, Martin AU - Bester, W AU - van der Merwe, B AB - Whereas Perl-compatible regular expression matchers typically exhibit some variation of leftmost-greedy semantics, those conforming to the posix standard are prescribed leftmost-longest semantics. However, the posix standard leaves some room for interpretation, and Fowler and Kuklewicz have done experimental work to confirm differences between various posix matchers. The Boost library has an interesting take on the posix standard, where it maximises the leftmost match not with respect to subexpressions of the regular expression pattern, but rather, with respect to capturing groups. In our work, we provide the first formalisation of Boost semantics, and we analyse the complexity of regular expression matching when using Boost semantics. DA - 2018-10 DB - ResearchSpace DP - CSIR KW - Boost KW - POSIX KW - Regular expression matching LK - https://researchspace.csir.co.za PY - 2018 SM - 978-3-030-02507-6 SM - 978-3-030-02508-3 T1 - Formalising boost POSIX regular expression matching TI - Formalising boost POSIX regular expression matching UR - http://hdl.handle.net/10204/10936 ER - en_ZA


Files in this item

This item appears in the following Collection(s)

Show simple item record