Why Elixir ?

Object graph

universal knowledge representation

FRAMES

arbitrary attribute grammar data

The attribute grammar approach is widely used in compiler construction.

pointer-reference locality

There are some methods for implementing graph data structures such as graph adjacency matrix. We'll use the method of holding pointers to neighbor graph elements right into every node. This method has the property of locality: every node knows only its neighbors. While you are traversing the knowledge graph, this pointers set is short and enough. The advantage of this method it is tightly native to any programming language which supports object-oriented programming:

• every node is an object
• every object is typed by its class (optionally, in Python for example)
• every link between nodes is directed and represented by a reference (down to machine-level memory pointer)
• edge-source node knows all its targets, but not in a reverse
• to do a reversing traverse over a directed graph we need to have parent nodes pointers

AST is a special case of a directed graph

For the expression 1+2*3 we can draw this object graph:

or more precisely, with type/class **tag**s paired to node **value**s:

the mandatory <T:V> part of every node