Главная
Study mode:
on
1
Intro
2
About Kazakhstan
3
How did it start
4
Parser generators
5
What is parsing
6
Tokenizing
7
Why tokenizing
8
Lack of flexibility
9
Flexibility
10
FileReader
11
Token Recognition
12
Try Identifier
13
Automata
14
Formal Verification
15
States
16
Lambda
17
Auto
18
deterministic
19
extra words
20
Classifier
21
Replacing the code
22
Conclusion
Description:
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore the intricacies of generating parsers in C++ with Maphoon in this CppCon 2022 conference talk. Delve into theory-based bottom-up parsing as Hans de Nivelle introduces a C++17 tool for creating efficient parsers. Learn about the two-stage parsing process, including tokenizing and building Abstract Syntax Trees (AST). Discover how to use regular expressions and custom code for tokenizing, and how to describe formal grammars to build ASTs. Gain insights into the tool's user-friendly design, support for modern C++, and its ability to demonstrate parsing processes and underlying automata. Understand the advantages of runtime operator definition and improved error message handling in bottom-up parsing.

Generating Parsers in C++ with Maphoon - Part 1 - CppCon 2022

CppCon
Add to list