In this articles we’re going to implement a Mark-Sweep garbage collector in C++.
This is the 9th lecture from the Essentials of Garbage Collectors course where we discuss in detail all the aspects of automatic memory management.
In the previous article on Writing a Memory Allocator we discussed and implemented a generic memory allocator. We have seen how a memory is requested from OS (through the memory mapping), and in particular focused on different strategies of the Free-list allocation.
In today’s lecture we’ll be discussing a Pool allocator.
This is the 6th lecture from the Garbage Collection Algorithms class, devoted to the automatic memory management.
Before discussing algorithms of collecting the garbage, we need to see how these objects (which eventually become a garbage) are allocated on the heap. In today’s lecture we consider mechanisms of memory allocation.
In this post we’ll briefly talk about a new language agnostic parser generator, called Syntax. It allows generating fast parsers for different languages, as well as to analyze parsing process, building parsing tables, sets, etc.
MIPS architecture is used in many embedded systems today, including gaming consoles, routers, and other devices. It is a RISC architecture, which makes decoding of the instructions easier, and the number of basic instructions is not that big (in contrast with CISC architecture, used e.g. in x86). This makes MIPS a good learning architecture, and that’s why it’s often used in universities in compiler class for code generation. And as a part of course for implementing a virtual machine for a subset of MIPS instructions, I have built the parser for its assembly. Continue reading
Sometimes more code in a source language, can mean less code in a generated language.
I’ve been playing with generated (native) code in order to test how compilers (specific or in general) translate
a = a + 1 and
a++, and found some other interesting optimizations. Continue reading