WeAreDevelopers LIVE Sep 18, 2024

How Regex Works: The Secret Sauce Behind Pattern Matching

Andrii Raikov

Does your regex rely on inefficient backtracking that triggers catastrophic time complexity? Discover how translating patterns into concurrent state machines guarantees predictable performance.

Pause
Mute Enter Fullscreen
#1 about 2 min

Approaching a regular expression matching challenge

An introductory review of a coding challenge requiring support for character literals and repeatable symbols.

#2 about 2 min

Designing pattern validation chains with linked lists

Using structural sequence linking to evaluate character strings iteratively against explicit condition models.

#3 about 2 min

Scalability limitations and extensibility issues in custom algorithms

How tightly coupled sequence chains break down when subjected to massive scaling or complex parsing logic like email validation.

#4 about 3 min

Mapping regular expressions to state machine node architectures

How string expressions directly map onto loop segments and graph representations serving as sequential logic structures.

#5 about 4 min

Deterministic logic versus non-deterministic state generation

The mechanical differences between modeling finite paths where single configurations limit evaluations versus nodes that yield multiple parallel transition choices.

#6 about 4 min

Compiling regular expressions into discrete execution maps

Breaking larger algorithmic parsing instructions into tiny connected sets of transitions using unlabeled path mappings.

#7 about 2 min

Algorithmic complexity issues triggered by pattern backtracking

How automatically testing alternate branch paths after earlier failures introduces exponential processing cycles.

#8 about 2 min

Eliminating branch recursion via concurrent state tracking

Tracking concurrent nodes in runtime models bypasses the exponential slowness inherent to naive recursive tree traversal.

#9 about 7 min

Writing finite state compilers using struct properties and linked matrices

Building non-deterministic nodes embedded inside memory arrays to programmatically parse text using typed struct logic architectures and lists.

Matching moments

1:05 min

Deconstructing and explaining complex regular expressions with AI

Markus Walker Markus Walker · WWC 2023

2:32 min

Generating and testing regular expressions with technical prompts

Markus Walker Markus Walker · WWC 2023

3:09 min

Implementing regex, classifiers, and LLM-as-a-judge guardrails

Cansu Kavili Örnek Cansu Kavili Örnek · WWC Europe 2026

6:31 min

Leveraging abstract syntax trees for reliable code transformation

Nicolas Carlo · JS Congress

2:44 min

Leveraging AI tools to translate English commands into regex

Chris Heilmann +2 · LIVE

4:03 min

Security risks of trusting AI-generated code and regex

Chris Heilmann +2 · LIVE

Upcoming sessions on this topic

Open session

World Congress 2026 North America

Designing APIs That Survive AI Agents at Scale

Phani Pendurthi

Mastercard, Principal Software Engineer

Phani Pendurthi
Open session

World Congress 2026 North America

Beyond Vibe Coding: An AI Builder’s Guide to Migrating 10k+ React Components

Shubham Chaurasia

Senior Software Engineer @ Meta

Shubham Chaurasia
Open session

World Congress 2026 North America

There's no dark factory without better software verifiers

Dexter Horthy

Co-Founder, HumanLayer

Dexter Horthy
Open session

World Congress 2026 North America

When Humans Stop Writing Code: Rethinking Languages, Compilers, and Responsibility

Simon Auer

Organizer of flutter vienna meetup and CEO of marqably

Simon Auer
Open session

World Congress 2026 North America

The spectrum of agentic coding: From vibe coding to high-quality software engineering

YK Sugi

Developer Experience Manager at Eventual

YK Sugi
Open session

World Congress 2026 North America

Honey, look! I vibe-coded an OS!

Ian Smith

CTO, LYOS

Ian Smith