Erick Lumunge

Instruction selection involves choosing target-language instructions for each IR statement. In this article we discuss how it can be done by a tree-rewriting process whereby tree patterns that correspond to machine instructions are used to tile a syntax tree.

An activation tree is a tree structure that represents function calls made by a program during execution. When a function is called the a new activation record is pushed to the stack and popped from the stack when the function returns.

In this article we discuss attribute dependency graphs and attribute evaluation during semantic analysis phase in compiler design.

Code written in high-level programming languages has a lot of overhead, in this article we discuss low-level techniques used to optimize this code for efficiency.

During the code generation phase, the compiler has to make jumps, however, the values needed for these jumps may not be known in a single pass therefore it improvises by filling up values which are replaced when the real values are known, a process known as backpatching.

A compiler is a program that translates source code into machine code that can be executed by a computer. In this article we explore various types of compilers.

The pumping lemma is used as a way to prove if a language is context-free or not. In this article we have discussed this lemma for CFLs.

In this article we discuss YACC and Bison, both tools used to generate parsers for context free languages that are LALR(1).

In this article, we discuss the different major types of programming languages, how they are used, and their pros and cons.

A compiler is responsible for translating high-level source code into low-level code. In this article, we go over a brief overview of the compiler design domain, a very successful field in computer science.