State Machines and Automata: Building a RegExp Machine: Deep Dive into State Machines, Finite Automata, and Regular Expressions

Dmitry Soshnikov

€8.99 ~~€37.99~~

Video Apr 2021 1hr 47mins 1st Edition

Dmitry Soshnikov

€8.99 ~~€37.99~~

Video Apr 2021 1hr 47mins 1st Edition

What do you get with a video?

Download this video in MP4 format

Access this title in our online reader with advanced features

DRM FREE - Read whenever, wherever and however you want

View table of contents

Key benefits

Learn about RegExp history and regular grammars
Learn about character and epsilon NFA fragments
Learn about NFA acceptor and NFA table

Description

It’s not a secret that big tech companies, such as Google, Facebook, and others, organize their recruiting process around generalist engineers who understand basic fundamental systems, data structures, and algorithms. In fact, it’s a known issue in tech-recruiting; there are a lot of “programmers”, but not so many “engineers”. And what does define an engineer in this case? An ability to solve complex problems, with understanding (and experience) in those generic concepts. And there is a simple trick how you can gain great experience with transferable knowledge to other systems. You take some complex theoretical field, which might not (yet) be related to your main job, and implement it in a language you’re familiar with. And while you build it, you learn all the different data structures and algorithms that accommodate this system. It should specifically be something generic (for example, state machines) so that you can further transfer this knowledge to your “day-to-day” job. In this course, we take this approach. To study automata “theory”, we make it more practical: we take one of its widely used applications, the lexical analysis and pattern matching, and build a RegExp machine.

Who is this book for?

This course is mainly for compiler engineers. However, all curious engineers willing to tackle a complex project building a RegExp machine based on finite automata would find it useful. Notice that this class is not about how to use regular expressions (you should already know what a regular expression is and actively use it on practice as a prerequisite for this class), but rather about how to implement the regular expressions—again, with the goal to study generic complex systems.