This commit is contained in:
Mark 2023-02-03 15:59:10 -08:00
parent 9653f103dc
commit 1e50ad503d

View File

@ -18,7 +18,7 @@
{The Regex Warm-Up}
{Prepared by Mark on \today}
Last time, we discussed Deterministic Finite Automata. One interesting application of these mathematical objects is pattern matching, usually in the form of Regular Expressions. \\
Last time, we discussed Deterministic Finite Automata. One interesting application of these mathematical objects is found in computer science: Regular Expressions. \\
(abbreviated \say{regex}, which is pronounced like \say{gif})
\vspace{2mm}
@ -61,7 +61,7 @@
Brackets \htexttt{\{min, max\}} are the most flexible quantifier. \\
They specify exactly how many tokens to match: \\
\htexttt{ab\{2\}a} will match only \texttt{abba}. \\
\htexttt{ab\{1,3\}a} will match \texttt{aba}, \texttt{abba}, and \texttt{abbba}. \\
\htexttt{ab\{1,3\}a} will match only \texttt{aba}, \texttt{abba}, and \texttt{abbba}. \\
\htexttt{ab\{2,\}a} will match any \texttt{ab...ba} with at least two \texttt{b}s.
\vspace{5mm}