A state of сompile time regular expressions
Learn how to parse a regular expression pattern in compile-time and generate matcher with finite automaton.
In this talk Hana will present an advancement on the Compile Time Regular Expression (CTRE) library. The library was designed with new C++20 features, and it uses novel techniques.
The primary topic of this talk will be an explanation of the new Finite Automaton (FA) based engine in the library and how it’s built and optimized during compilation. Hana will explain the differences and limitations of the new engine in comparison to the previous Back Tracking engine. She will address these differences with a benchmark and discuss the generated assembly.
Even if you are not interested in regular expressions, you will learn new techniques in compile-time meta-programming and see new C++20 features in action.