Loading…
C++Now 2019 has ended
Back To Schedule
Tuesday, May 7 • 09:00 - 10:30
Compile Time Regular Expressions with Deterministic Finite Automaton

Log in to save this to your schedule, view media, leave feedback and see who's attending!

Tweet Share
Feedback form is now closed.
In this talk I 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. This presentation independently sums up the work since my previous CppCon talk about the library.

The primary topic of this talk will be an explanation of the new Deterministic Finite Automaton (DFA) engine in the library and how it's built and optimised during compilation. I will explain the differences and limitations of the new engine in comparison to the previous Back Tracking engine. I will address these differences with a benchmark and I will 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.
Speakers
avatar for Hana Dusíková

Hana Dusíková

Staff Scientist, AVAST
Hana works as a staff scientist at Avast Software. She is the Czech National Body chair for SC22 and WG21. She is also chair of WG21's Study Group for Compile-Time Programming, where C++'s future Reflection facilities are being developed.

Tuesday May 7, 2019 09:00 - 10:30 MDT
Paepcke Auditorium
  lecture

Attendees (96)