Compile Time Regular Expressions with a Deterministic Finite Automaton

Explore an advanced presentation on the Compile Time Regular Expression (CTRE) Library, focusing on the new Deterministic Finite Automaton (DFA) engine. Learn how this engine is built and optimized during compilation, and understand its differences and limitations compared to the previous Back Tracking engine. Gain insights into novel compile-time meta-programming techniques and see C++20 features in action. Examine benchmarks and generated assembly to compare engine performance. Benefit from the expertise of Hana Dusíková, a senior researcher at Avast Software, as she shares her advancements in compile-time regular expressions since her previous CppCon talk. Whether you're interested in regular expressions or seeking to expand your knowledge of modern C++ techniques, this talk offers valuable insights for C++ developers and enthusiasts.

C++Now 2019: Hana Dusíková “Compile Time Regular Expressions with A Deterministic Finite Automaton”