Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore the second part of a comprehensive conference talk on generating parsers and tokenizers in C++ using Maphoon. Delve into bottom-up parsing techniques, tokenization processes, and the creation of Abstract Syntax Trees (ASTs). Learn about the two-stage parsing process, including tokenizing with regular expressions and constructing tree representations. Discover how Maphoon supports both stages, offering automation and flexibility in parser generation. Examine the tool's user-friendly design, support for modern C++, and its ability to generate efficient parsers while maintaining transparency about underlying theory. Gain insights into runtime operator definition, error message tuning, and the visualization of parsing processes and automata. Follow along as the speaker demonstrates practical applications and discusses various parsing concepts, including syntax trees, rewrite rules, ambiguity, and error handling.