Re: Another Introduction

>A binary language? That sounds interesting, could you give us more
>details on how it works? Is it a B-Tree or something like that?
It doesn't use a B-tree, but a simple binary tree with words in the leaves,
I guess.  This way, no word is the prefix of another, so the words are
self-delimiting, and any bit string can be uniquely broken into words (with
possibly an unfinished word at the end).  This is because I want the
language to be completely parsable with no look-ahead whatsoever.

For a similar reason, each word takes a fixed number of arguments, all of
which follow it; that is, it essentially uses Polish notation.  (Most words
which take arguments have one bit at the end for each argument which is 0 if
it is present and 1 otherwise).

Alex

Reply