A Flexible and Efficient ML Lexer Tool Based on Extended Regular Expression Submatching
No abstract available.
DOI 10.1007/978-3-642-54807-9_10
Related papers
- Formally Verified Linear-Time Invertible Lexing CAV 2026
- Symbolic Boolean derivatives for efficiently solving extended regular expression constraints PLDI 2021
- EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination PLDI 2026
- Verbatim++: verified, optimized, and semantically rich lexing with derivatives CPP 2022
- Verified and Efficient Matching of Regular Expressions with Lookaround CPP 2025
- Combining MLIR Dialects with Domain-Specific Architecture for Efficient Regular Expression Matching CGO 2025
- Automatic repair of regular expressions OOPSLA 2019
- Lean Formalization of Extended Regular Expression Matching with Lookarounds CPP 2024