I've been covering some heavy topics lately with my Stack Machine & Compiler series, so I figured I would break things up with a light interlude on a topic that is both fascinating, easy to follow, and most of all fun: Cell
If you've been following along with my latest series of posts, then welcome to part four of my journey to compile a high level language to my virtual stack machine.
At the end of my previous article we had a fully featured stack machine that is Turing complete - meaning that it is capable of "universal computation". We already have an assembly language for our stack machine, but programmin
In the early days of computing, before the time of standardized instruction sets - or standardized anything really - software was decidedly non-portable. If you wrote a piece of software on machine A, it more than likely would
-
Ternary Search Tries: String Specific Ordered Symbol Tables
-
Digital Search Trees
-
Lossless Compression Part III: Huffman Coding
-
Lossless Compression Part II: The LZ77 Algorithm
-
Lossless Compression Part I: Working with Bits in a Byte Oriented World
-
Bottom Up AVL Tree: The OG Self-Balancing Binary Search Tree
-
A Different Take on Merge Sort: Binary Search Trees?
-
Deleting Entries From Open-Address Hash tables
-
Transform any Binary Search Tree in to a Sorted Linked List
-
From Regular Expressions To NFA by way of Abstract Syntax Trees: Thompsons Construction