In this final post, we'll explore how our simple lexical analyzers and parsers can be practically applied to solve meaningful and interesting problems.
Read More

In this post, we will continue developing our compiler by implementing its second component: the syntactic analyzer. Along the way, we’ll explore the tools commonly used for this purpose (such as grammars).
Read More

In this post, we will begin building our compiler by developing the first component: the lexical analyzer. Along the way, we’ll explore how tools like finite automata can prove to be extremely useful.
Read More

In this post, we will begin developing our mathematical engine by exploring how to model mathematical expressions and functions in C#. This process will also allow us to introduce the concept of grammars.
Read More

In this post, we will explore what a compiler is precisely and examine the various phases that make up the compilation process.
Read More

Starting today, we are launching an in-depth series on compilation, exploring how a program written in a high-level language is parsed and translated for machine comprehension. Our goal is to provide a comprehensive understanding of compiler engineering, and throughout this series, we will illustrate key concepts by …
Read More

In this final post, we will provide a brief overview of the applications of Bloom filters and discuss their potential limitations.
Read More

In this post, we will implement a Bloom filter in C# and demonstrate its functionality through a concrete application: we will show how it can be used to quickly check if a URL is malicious.
Read More

In this post, we will formalize what we previously discussed and provide a precise definition of a Bloom filter. We will then delve into the mathematical principles behind it, focusing on the optimization of its parameters.
Read More

In this post, we will provide an informal introduction to Bloom filters using a simple analogy with a stamp collection.
Read More