Monthly Archives: May 2011

Nova works fairly well. The parsing, as foreseen, was quasi trivial to implement. Each rule produces a node, that is a list of subnodes, and a reference to the rule that produced it. An optional/repetition rule may produce an empty … Continue reading →

Or rather, sool’s parser is going meta. For the interest of science (or more like fun), I am making a generic LL(1) parser. It reads in a grammar, described using Lua tables with the appropriate format, checks whether it is … Continue reading →

Grammar/syntax In the spirit of “let’s keep things simple”, I want the language to be simple to parse. A simple parser to write is the “recursive descent” parser, in which each rule of the grammar is a function, which recursively … Continue reading →

Memory management 2 After giving a bit of thought to the comments that concluded the last post, I decided that I really liked the idea of tombstone + main owner + weak references. Let’s see what would be the implications … Continue reading →

In a previous post, I whine and rambled about how no high level programming language was perfect, and concluded on interrogations on what was my ideal programming language. Since then, I took the thing one step further and started designing … Continue reading →