Regular Expressions Redefined in C++
summary
Claims a C++ library that turns regex literals into types at compile time, with a small LL(1) parser that translates patterns into the same type and eliminates interpretation. Compile-time regular expressions are implemented in Clang and GCC. Given a grammar it can parse JSON. Generated code compiles down to about 78 instructions, uses no recursion and ends in two opcodes, showing concrete speed and size benefits rather than vague examples.
AI-written summary · about
related talks
01h 03mCompile-time Regular Expressions
23mFunctional Programming in C++ (Run time vs Compile time types)
07mCan I has grammar?
54mCompile-Time Validation in C++ Programming
46mBinary Parsing - C++23 Style!
01h 02mEmbedded Friendly C++: Features That Make a Difference
01h 39mKeynote - C++ Metaprogramming: evolution and future direction
02h 02mPeering forward: C++'s next decade