Computer Science
Formal grammars, parsers, finite automata, and how regular expressions work under the hood.
2019
-
Regex, Part 3: Matcher
Explore two different regex matching algorithms
-
Regex, Part 2: Compiler
What are Type-2 (or regular) languages? How can Finite State Automaton be used to recognize them? Where do regex fit into all this?
-
Regex, Part 1: Parser
Exploring Parser Combinators (or monadic parsers) which are a great example of functional programming used to bring practical benefits
-
Regex, Prologue: Grammar
Using a formal grammar to describe a regular expression language
-
Let's Build a Regex Engine
★How to understand the language of
<\/?[\w\s]*>|<.+[\W]>