Formalising Boost POSIX regular expression matching

DOI10.1007/978-3-030-02508-3_6MaRDI QIDQ1623122zbMATH OpenOpenAlexFDO

Authors Martin Berglund, Willem Bester, Brink van der Merwe

Publication date 23 November 2018

Full work available at URL https://doi.org/10.1007/978-3-030-02508-3_6

zbMATH Keywords

POSIXregular expression matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Formalising and implementing Boost POSIX regular expression matching
• Disambiguation in regular expression matching via position automata with augmented transitions
• POSIX regular expression parsing with derivatives
• On the semantics of regular expression parsing in the wild
• POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)

Cited in

(4)

• Formalising and implementing Boost POSIX regular expression matching
• POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
• POSIX lexing with derivatives of regular expressions
• POSIX regular expression parsing with derivatives

Describes a project that uses

Uses Software

• TRE
• PCRE
• Boost
• PERL

This page was built for publication: Formalising Boost POSIX regular expression matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623122)