A State of Compile Time Regular Expressions
summary
Covers improvements to the CTRE (Compile Time Regular Expression) library implemented with C++20, focusing on a new compile-time Deterministic Finite Automaton (DFA) engine and how it is constructed and optimized during compilation. Compares the DFA engine’s behavior, limitations and performance against the prior backtracking engine using benchmarks and generated assembly, and demonstrates C++20 metaprogramming techniques used in the implementation.
AI-written summary · about
chapters (7)
- 0:00Start
- 3:04COMPILE TIME REGULAR EXPRESSIONS
- 7:00EXAMPLE: NON-FORMAL SYNTAX CONSTRUCTS
- 9:00HOW DOES AN LL(1) PARSER WORK?
- 13:39HOW DO WE IMPLEMENT THE STACK?
- 38:12CONSTEXPR PROBLEMS
- 43:38MATCHING A TRANSITION
