Abhinav Pradeep's Blog

Extending the NFA generator Previously we implemented a regular expression matching algorithm that generated an NFA from an input regular expression, and simulated a string over the NFA to check for acceptance.

Introduction The first step in building a compiler would be to build a lexical analyzer, shortened to ’lexer’.

Notes from learning measure theory.

First in a series about building a DBMS on the Raspberry Pi Pico.

Notes from learning measure theory.

This article covers the tree data structure.

Notes from learning measure theory.

What are decision trees?

Visual basic .NET was launched as a successor to Visual Basic in 2002.

Today, we take a break from my series on sorting algorithms and look at thread-safety.

This is the third post in my series on sorting algorithms.

This is the second post in my series on sorting algorithms.

Recently, I’ve been learning about different types of sorting algorithms.

PHP is a popular serverside scripting language.

Application Programming Interfaces ( API) have been around since the early days of IT.

My blog looks completely different.

Today was a pretty boring day.

Yesterday was a pretty busy day for me.

Yesterday night was horrible.

Today I started out early.