Repeating yourself: Compiling While Loops to P-Code

In my previous post on code generation we got our feet wet with compiling some basic expressions to p-code. In todays post I'm going to pick up where we left off and jump right in with control statements. In particular,

Removing an entry from a B+ Tree without Rebalancing: A viable approach?

When it comes to data structures - especially self balancing data structures - it is no secret that the algorithms for removing an entry are often many, many times more complex than the algorithms for adding a value. Anyone w

Implementing An Iterator for In-Memory B-Trees

Well, it looks like I'm back at it, implementing iterators for all the things and up this time: In-memory B Trees. Now, It's no secret that that an iterator for an ordered container is simply an In-order traversal performed step-wise over said

Weight Balanced Binary Search Trees

When it comes to self balancing binary search trees it is almost always assumed that the balance one is referring to is that of access path length. The "traditional" definition of a balanced binary search tree is a tree where the difference in

Parsing Array Subscript Operators with Recursive Descent

Well, It looks like I'm back with another Recursive Descent post. This time I'm going to learn you how to parse those pesky Nth dimensional array references and deeply nested object members using recursive descent. So grab some coffee, strap in, and le

Search
Recent Posts
Meta