Formalising and implementing Boost POSIX regular expression matching

DOI10.1016/j.tcs.2021.01.010zbMath1477.68145OpenAlexW3118520292MaRDI QIDQ2220787

Willem Bester, Martin Berglund, Brink van der Merwe

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.01.010

zbMATH Keywords

regular expression matchingPosix

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• PERL
• Boost
• TRE
• regex

Cites Work

• Unnamed Item
• Formalising Boost POSIX regular expression matching
• On the semantics of regular expression parsing in the wild
• Derivative-Based Diagnosis of Regular Expression Ambiguity
• Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
• Symbolic finite state transducers
• Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
• POSIX Regular Expression Parsing with Derivatives
• Automata, Languages and Programming
• Programming Techniques: Regular expression search algorithm
• One-unambiguous regular languages

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