On the semantics of regular expression parsing in the wild

DOI10.1016/J.TCS.2016.09.006zbMath1371.68141OpenAlexW2523499347MaRDI QIDQ2357106

Martin Berglund, Brink van der Merwe

Publication date: 19 June 2017

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

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

zbMATH Keywords

capturing groupsprioritized transducersregular expression matchers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (3)

Ordered context-free grammars ⋮ On the semantics of atomic subgroups in practical regular expressions ⋮ Formalising and implementing Boost POSIX regular expression matching

Uses Software

• ebs

Cites Work

• Translating regular expression matching into transducers
• Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
• From Ambiguous Regular Expressions to Deterministic Parsing Automata
• On the Semantics of Regular Expression Parsing in the Wild
• Cuts in Regular Expressions
• Automata, Languages and Programming
• Programming Techniques: Regular expression search algorithm
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the semantics of regular expression parsing in the wild