Regular Expressions Machinery, The Illustrated Guide, Nöteberg S., 2026

Regular Expressions Machinery, The Illustrated Guide, Nöteberg S., 2026.

   This book is written for those who want to deeply understand regular expressions. Maybe you’ve come across them in programming languages or tools but never really understood how they work under the hood. Even though the book is based on advanced mathematics, you don't need any prior knowledge.
Unlike many other books that focus solely on syntax, this book starts with a deep dive into the underlying automata theory. This provides you with a deeper understanding of how regular expressions work on a fundamental level. Clear illustrations and straightforward explanations make university-level mathematics accessible for everyone.
The goal of the book is to give you a deep understanding of regular expressions so that you can use them with confidence and efficiency in your work.




States and Transitions.
You can be in only one country at a time. Suppose you're traveling by train on a continent comprising eight countries. You always start your trips from your home country. With the right ticket, you can travel from the country in which you're currently located to a neighboring country. You may also take a trip within a country, that is, the journey starts and ends in the same country.

Buy a ticket booklet, and you can make it a tour, that is, you can take several trips, but you're forced to use the tickets in the order in which they're placed in the ticket booklet. If the next ticket in the booklet isn't valid for any trip departing from the country you currently are in, you've failed. You've also failed when you use the entire ticket booklet and end up in a country for which you don't have a permanent residence permit. However, if you start in your home country, take a tour so that you use the entire ticket booklet, and end up in a country in which you do have permanent residence status — then you've succeeded! And don't forget, as I noted, you can be in only one country at a time.

Contents.
Introduction.
PART I: The Automaton.
Transition Diagram.
Alphabet.
States and Transitions.
Transitions Table.
Nondeterministic Finite Automaton.
Greedy and Reluctant.
NFA to DFA.
Pushdown Automata.
PART II: Two Operations and One Function.
History of Regular Expressions.
Match One Character.
Four More Rules.
Operation №1: Concatenation.
Operation №2: Alternation.
The Function: Kleene Star.
Precedence.
Some Examples With *, |, and ×.
Regular Expressions Are Finite Automata.
Traits.
Architecture.
Functions.
PART III: Syntactic Sugar, Abstractions, and Extensions.
Quantifiers.
Quantifier Equations.
Reluctant Quantifiers.
Possessive Quantifier.
Literal vs. Metacharacters.
Character Code Points.
Character Aliases.
The Period Symbol.
Shrthnd.
Unicode Categories, Scripts, and Blocks.
Generic Character Class.
Generic Character Class Negated and Tweaked.
Generic Character Class Escape.
Posix Character Class.
Grouping.
Capture and Back Reference.
Named groups.
Atomic Groups.
Anchors.
Lookarounds.
Part IV: Test-Driven Regex Development.
Wishful Thinking and Test-Driven Development.
TDD and Regression Testing.
TDD and Legacy Code.
Afterword.
Appendix A: Precedence.



Бесплатно скачать электронную книгу в удобном формате, смотреть и читать:
Скачать книгу Regular Expressions Machinery, The Illustrated Guide, Nöteberg S., 2026 - fileskachat.com, быстрое и бесплатное скачивание.

Скачать pdf
Ниже можно купить эту книгу, если она есть в продаже, и похожие книги по лучшей цене со скидкой с доставкой по всей России.Купить книги


Скачать - pdf - Яндекс.Диск.




Теги: учебник по программированию :: программирование :: Nöteberg