Magic Cloud

An Open Source Application Generator

Magic Node

Magic Node is a simple name/value/children graph object, in addition to a “Hyperlambda” parser, allowing you to create a textual string representations of graph objects easily transformed to its relational graph object syntax, and vice versa. This allows you to easily declaratively create execution trees using a format similar to YAML, for then to access every individual node, its value, name and children, from your C#, CLR code, or Hyperlambda. For the record, Hyperlambda is much easier to understand than YAML.

Hyperlambda is perfect for creating a highly humanly readable relational configuration format, or smaller DSL engines, especially when combined with Magic Signals and Magic Lambda. Below is a small example of Hyperlambda to give you an idea of how it looks like.


3 spaces (SP) opens up the children collection of a node, and allows you to create children associated with some other node. In the example above, the [child1] and the [child2] nodes, have [foo] as their parent. A colon : separates the name and the value of the node - The name is to the left of the colon, and the value to the right.

You can optionally supply a type between a node’s name and its value, which you can see above where we add the :int: parts between one of our [foo] nodes’ name and value.

To traverse the nodes later in for instance C#, you could do something such as the following.

var root = var result = new Parser(hyperlambda).Lambda();

foreach (var idxChild in root.Children)
   var name = idxChild.Name;
   var value = idxChild.Value;
   /* ... etc ... */

Supported types

Although the node structure itself can hold any value type you need inside of its Value property, Hyperlambda only supports serialising the following types by default.

The type declaration should be declared in your Hyperlambda in between the name and its value, separated by colon (:). The default type if ommitted is string. An example of declaring a couple of types associated with a node’s value can be found below.


Extending the type system

The type system is extendible, and you can easily create support for serializing your own types, by using the Converter.AddConverter method, that can be found in the magic.node.extensions namespace. Below is an example of how to extend the typing system, to allow for serializing and de-serializing instances of a Foo class into Hyperlambda.

 * Class you want to serialize into Hyperlambda.
class Foo
    public int Value1 { get; set; }
    public decimal Value2 { get; set; }

 * Adding our converter functions, and associating them
 * with a type, and a Hyperlambda type name.
    (obj) => {
        var foo = obj as Foo;
        return ("foo", $"{foo.Value1}-{foo.Value2}");
    }, (obj) => {
        var str = (obj as string).Split('-');
        return new Foo
            Value1 = int.Parse(str[0]),
            Value2 = decimal.Parse(str[1]),

The above will allow you to serialize instances of Foo into your Hyperlambda, and de-serialize these instances once needed. An example of adding a Foo instance into your Hyperlambda can be found below.


Later you can retrieve your Foo instances in your slots, using something resembling the following, and all parsing and conversion will be automatically taken care of.

var foo = node.Get<Foo>();

String literals

Hyperlambda also support strings the same way C# supports string, using any of the following string representations.

// Single quotes
foo:'howdy world this is a string'

// Double quotes
foo:"Howdy world, another string"

// Multiline strings
foo:@"Notice how the new line doesn't end the string

Escape characters are supported for both single quote strings, and double quote strings, the same way they are supported in C#, allowing you to use e.g. \r\n etc.

Lambda expressions

Lambda expressions are kind of like XPath expressions, except (of course), they will references nodes in your Node graph object, instead of XML nodes. Below is an example to give you an idea.

.foo:hello world

// After invocation of the above slot, its value will be "hello world".

Most slots in Magic can accept expressions to reference nodes, values of nodes, and children of nodes somehow. This allows you to modify the lambda graph object, as it is currently being executed, and hence allows you to modify “anything” from “anywhere”.


An expression is constructed from one or more “iterator”. This makes an expression become “dynamically chained Linq statements”, where each iterator reacts upon the results of its previous iterator. Each iterator takes as input an IEnumerable, and returns as its result another IEnumerable, where the content of the iterator somehow changes its given input, according to whatever the particular iterator’s implementation does. This approach just so happens to be perfect for retrieving sub-sections of graph objects.

Each iterator ends with a ”/” or a CR/LF sequence, and before its end, its value defines what it does. For instance the above iterator in the [get-value] invocation, starts out with a ”@”. This implies that the iterator will find the first node having a name of whatever follows its ”@”. For the above this implies looking for the first node who’s name is “.foo”. To see a slightly more advanced example, imagine the following.


It might help to transform the above expression into humanly readable language. Its English equivalent hence becomes as follows.

Find the node with the name of ‘.data’, then retrieve its children, and filter away everything not having a name of ‘item2’

Of course, the result of the above becomes “thomas”.

Below is a list of all iterators that exists in magic. Substitute “xxx” with any string, and “n” with any number.

Notice, you can escape iterators by using backslash “\”. This allows you to look for nodes who’s names are for instance “3”, without using the n’th child iterator, which would defeat the purpose. In addition, you can quote iterators by using double quotes ", to allow for having iterators with values that are normally not legal within an iterator, such as /, etc.

Below is an example of a slightly more advanced expression.


 * Notice!
 * This expression is probably more complex than anything
 * you'd normally need in your own code, but included for
 * reference purposes.
      :thomas was here

After evaluating the above Hyperlambda, the value of all nodes having “wo/rld” as their value inside of [.foo] will be updated to become “thomas was here”. Obviously, the above expression is a ridiculous complex example, that you will probably never encounter in your own code. However, for reference purposes, let’s break it down into its individual parts.

  1. Get parent node
  2. Get all children
  3. Filter away everything not having the name of {0}, which resolves to .:x:@.dyn, being an expression, who’s result becomes “.foo”.
  4. Get its children
  5. Find all nodes who’s value is “wo/rld”.

If your head hurts, just relax, and move onwards - I have never needed an expression as complex as the above myself as I have been using Hyperlambda myself. It’s only an example to illustrate the power of expressions. However, the {0} parts basically becomes a string substitution, possibly evaluating its n’th child, if the value of that child is another expression. This allows you to “parametrize” your expressions, which might be useful every now and then.

98% of your expressions will have 1-3 iterators, no complex escaping, and no parameters. And in fact, there’s thousands of lines of Hyperlambda code in Magic, and 98% of these expressions are as simple as follows.


Which translates into the following English.

Give me the value of any [foo1] nodes, inside of the [.arguments] node.

Extending lambda expressions/iterators

You can easily extend the expressions in this project, either with a “static” iterator, implying a direct match - Or with a dynamic parametrized iterator, allowing you to create iterators that requires parameters, etc. To extend the supported iterators, use any of the following two static methods.

Below is a C# example, that creates a dynamic iterator, that will only return nodes having a value, that once converted into a string, has exactly n characters, not less and not more.

Iterator.AddDynamicIterator('%', (iteratorValue) => {
    var no = int.Parse(iteratorValue.Substring(1));
    return (identity, input) => {
        return input.Where(x => x.Get<string>()?.Length == no);

var hl = @"foo
var lambda = new Parser(hl).Lambda();

var x = new Expression("../**/%3");
var result = x.Evaluate(lambda);

Notice how the iterator we created above, uses the %3 parts of the expression, to parametrize itself. If you exchange 3 with 5, it will only return [howdy1] and [howdy3] instead, since it will look for values with 5 characters instead. The Iterator class can be found in the magic.node.extensions namespace.

You can using the above syntax also override the default implementation of iterators, although I wouldn’t recommend it, since it would create confusion for others using your modified version.

Notice - To create an extension iterator is an exercise you will rarely if ever need to do, but is included here for reference purposes.


You can include the following NuGet packages into your project to access Magic Node directly.

However, all of these packages are indirectly included when you use Magic.

Documenting nodes, arguments to slots, etc

When referencing nodes in the documentation for Magic, it is common to reference them like [this], where “this” would be the name of some node - Implying in bold characters, wrapped by square [brackets].

Project website

The source code for this repository can be found at, and you can provide feedback, provide bug reports, etc at the same place.

Quality gates


This project is the copyright(c) 2020-2021 of Thomas Hansen, and is licensed under the terms of the LGPL version 3, as published by the Free Software Foundation. See the enclosed LICENSE file for details.