Dive deep into regular expressions and learn how to build a regex engine from scratch. Covers finite automata, Thompson's Construction, and practical programming techniques.
Technical TutorialsRegular Expressions
Introduction
A book on implementing a regular expression engine with practical examples and programming techniques.
Highlights
Understanding and using regular expressions properly is a valuable skill for text processing
Covers the theoretical foundations of finite automata, including deterministic finite automata (DFA), nondeterministic finite automata (NFA), and epsilon-NFA
Explains how to compile regular expressions to finite automata using Thompson's Construction
Provides practical examples and programming techniques for implementing a regular expression engine
Recommendation
This course is highly recommended for software developers who want to gain a deeper understanding of regular expressions and learn how to implement a regular expression engine from scratch. It covers both the theoretical concepts and practical implementation details, making it a valuable resource for anyone interested in text processing and pattern matching.
How GetVM Works
Learn by Doing from Your Browser Sidebar
Access from Browser Sidebar
Simply install the browser extension and click to launch GetVM directly from your sidebar.
Select Your Playground
Choose your OS, IDE, or app from our playground library and launch it instantly.
Learn and Practice Side-by-Side
Practice within the VM while following tutorials or videos side-by-side. Save your work with Pro for easy continuity.