Understand the underlying theory behind recursive descent parser for a programming language
About This Video
- Learn about basic expression and tokenizer
- Learn about program structure and AST formats
- Learn about control flow and functions
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.
Table of contents
- Chapter 1 : Basic Expressions and Tokenizer
- Chapter 2 : Program Structure
- Chapter 3 : Control Flow and Functions
- Chapter 4 : Object-Oriented Programming
- Title: Building a Parser from Scratch
- Release date: April 2021
- Publisher(s): Packt Publishing
- ISBN: 9781801075107
You might also like
51+ hours of video instruction. Overview The professional programmer’s Deitel® video guide to Python development with …
40 Algorithms Every Programmer Should Know
Learn algorithms for solving classic computer science problems with this concise guide covering everything from fundamental …
Python Crash Course, 2nd Edition
This is the second edition of the best selling Python book in the world. Python Crash …
Tiny Python Projects
The projects are tiny, but the rewards are big: each chapter in Tiny Python Projects challenges …