Implementation of a complete compiler.

Feb 1, 2015#创作集1957

AI Translation

This post is translated from Chinese into English through AI.View Original

AI-generated summary

This series will demonstrate the complete implementation process of a compiler, starting from scratch. The goal is to translate an incomplete subset of the C language into x86 assembly language, using tools such as Lex, Yacc, and LLVM. Additionally, garbage collection and object-oriented programming will be implemented. The code is hosted on GitHub, and the implementation is divided into 11 stages, including lexical analysis, syntax analysis, semantic actions, semantic analysis, stack frame layout, translation, normalization, instruction selection, control flow analysis, data flow analysis, register allocation, and code generation. The series has already completed the implementation of lexical analysis and syntax analysis.

Turing gives birth to machines, machines give birth to assembly, assembly gives birth to C, C gives birth to everything
(from Zhihu user Joy Neop)

This series will demonstrate the implementation process of a complete compiler from scratch.

The goal is to translate an incomplete subset of the C language into x86 assembly language, with the help of tools such as Lex Yacc and LLVM. Additionally, garbage collection and object-oriented programming will be implemented.

All the code is hosted on GitHub. The source code for each stage can be viewed here.

The main reference is the "Tiger Book" ("Modern Compiler Implementation in C"), and based on this book, the implementation is divided into 11 stages: lexical analysis, syntax analysis, semantic actions, semantic analysis, stack frame layout, translation, normalization, instruction selection, control flow analysis, data flow analysis, register allocation, and code emission.

Completed stages:

"Implementation of a Complete Compiler - Lexical Analysis | Anotherhome"

"Implementation of a Complete Compiler - Syntax Analysis | Anotherhome"

To be continued...