From Parse Trees To AST's: Predictive Parsing using Recursive Descent

In the process of turning text into executable programs two of the early transformations that take place are converting said text into a stream of tokens - commonly called "lexing", and transforming this token stream into abstract syntax tree (AST). Th

An Abstract Memory Store

In my previous post I went over one possible scheme for an Object structure suitable for implementing dynamic typing in an interpreter. Tha

Implementing Dynamic Typing with Tagged Unions

The Owl Runtime Environment: The Call Stack

Programs rarely exist in isolation. With a few exceptions, a program requires a supporting environment within which to run. For a compiled language, this can be handled by the operating system or in more extreme cases like micr

Introducing Owl

Search
Recent Posts
Meta