Understand the underlying theory behind recursive descent parser for a programming language
Parsing or syntactic analysis is one of the first stages in designing and implementing a compiler. A well-designed syntax of your programming language is a big motivation why users would prefer and choose your language.

Recursive descent parsers are the group of parsers that are widely used in practice in many production programming languages. In contrast with automated parsing algorithms, the manual implementation allows having full control over the parsing process and handling complex constructs, which may not be possible in the automatic parsers.

Besides, implementing a full manual parser from scratch allows understanding and seeing this process from inside, demystifying internal structures, and turning building parsers into an interesting engineering task.

In the Building a Parser from Scratch class, we dive into pure practical implementation, building and learning different aspects of parsers.

In this course, you will learn the concept of recursive descent parsing, understand what is tokenizer and how it cooperates with the parser module, learn what is Abstract Syntax Tree (AST) and how to have different formats of these ASTs, what is "lookahead" and predictive parsing, and eventually build a parser for a full programming language, similar to Java or jаvascript.

All resources and code files are placed here:

https://github.com/PacktPublishing/Building-a-Parser-from-scratch

Installation:
Unpack that shit, run that shit