Optimizing Trees — How to Create a Compiler part 2/5 — Simple optimizations to a program in an AST

In this tool-assisted education video series I create a compiler in C for a B-like programming language. In this episode we deal with simple optimization techniques like constant folding and dead code elimination, and also look into ways to simplify the internal representation of the code. This is part of a multi-episode series. In the next video, we will deal with a different intermediate representation. Become a member: Downloads: — All the material associated with this episode can be downloaded here. Check out this book if you would like to learn more indepth about compilers and optimization (Amazon affiliate link): — =as_li_tl?ie=UTF8&camp=1789&creative=9325&creativeASIN=1558603204&linkCode=as2&tag=oellilu-20&linkId=973a02b8027731c84e9875e552d55ac9 Acknowledgements: — Music¹: Aryol :: Warmup ::