AST on AI VOID

Chapter 3: Crafting the Parser: Building the Abstract Syntax Tree (AST)

Tue, 17 Mar 2026 00:00:00 +0000

Chapter 3: Crafting the Parser: Building the Abstract Syntax Tree (AST)

Welcome to Chapter 3 of our journey to build a robust Mermaid analyzer! In the previous chapter, we successfully laid the foundation with our lexer, transforming raw Mermaid code into a stream of meaningful tokens. This chapter marks a significant leap forward as we tackle the next crucial phase of our compiler pipeline: parsing. Here, we will take the tokens generated by the lexer and construct a strongly typed Abstract Syntax Tree (AST).

Chapter 4: The Core AST: Representing Mermaid Structures in Rust

Tue, 17 Mar 2026 00:00:00 +0000

Chapter 4: The Core AST: Representing Mermaid Structures in Rust

Welcome to Chapter 4 of our journey to build a production-grade Mermaid analyzer and fixer! In the previous chapter, we laid the groundwork by creating a robust lexer that converts raw Mermaid text into a stream of meaningful tokens. Now, it’s time to elevate our understanding of the Mermaid structure by transforming these tokens into a rich, strongly typed Abstract Syntax Tree (AST).

Chapter 5: Strict Validation Layer: Detecting Syntax and Semantic Errors

Tue, 17 Mar 2026 00:00:00 +0000

Chapter 5: Strict Validation Layer: Detecting Syntax and Semantic Errors

Welcome to Chapter 5 of our journey to build a production-grade Mermaid analyzer and fixer. In the previous chapters, we successfully developed a robust lexer to tokenize Mermaid input and a sophisticated parser to transform those tokens into a strongly typed Abstract Syntax Tree (AST). With the raw structure of the Mermaid diagram now represented in a programmatic form, it’s time to introduce the critical next phase: the Strict Validation Layer.

Chapter 9: Advanced Parsing & Edge Cases: Nested Structures and Complexities

Tue, 17 Mar 2026 00:00:00 +0000

Chapter 9: Advanced Parsing & Edge Cases: Nested Structures and Complexities

Chapter Introduction

Welcome to Chapter 9 of our journey to build a robust Mermaid analyzer and fixer in Rust! In the previous chapters, we laid the foundational blocks of our parser, successfully tokenizing and building an Abstract Syntax Tree (AST) for basic Mermaid structures like simple nodes and edges. However, real-world Mermaid diagrams often involve more intricate constructs, such as nested subgraphs, multiline labels, escaped characters, and inline comments. These elements introduce significant complexity to our parsing logic and demand careful consideration to ensure strict adherence to the Mermaid specification.