Regular expressions that work "everywhere"
Summary
The article discusses the challenges of regex portability across tools like sed, awk, grep, and Emacs, and provides a subset of regex features that work reliably across these environments.
View Cached Full Text
Cached at: 06/28/26, 01:52 AM
Similar Articles
what 262,715 regex questions on stack overflow haven't answered
The author analyzes 262,715 Stack Overflow questions to identify common regex pain points and demonstrates how their new regex engine, RE#, solves these issues using complement and intersection operations.
what 262,715 regex questions on stack overflow haven't answered (part 2)
A deep dive into the limitations of regex for parsing HTML, inspired by the famous Stack Overflow answer, discussing formal language theory and the power of industrial regex engines.
May I recommend… understanding Emacs's patterns
The article explains Emacs's architectural patterns, focusing on the universal buffer data model and incremental completing read (ICR), comparing them to a rose's roots and petals. It highlights how Emacs unifies interfaces and allows extensibility via Elisp.
Regex Chess: A 2-ply minimax chess engine in 84,688 regular expressions
Nicholas Carlini's project implements a 2-ply minimax chess engine using 84,688 regular expressions, executed sequentially to play valid chess moves. The post explains the design of a regular expression computer that interprets instructions.
ReSyn: A Generalized Recursive Regular Expression Synthesis Framework
ReSyn is a generalized recursive framework for synthesizing regular expressions from examples, aiming to improve upon existing synthesis techniques.