prism-compiler 0.1.0

An adaptive and functional programming language
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

<div align="center">
  <h1><code>Prism Compiler</code></h1>
  <p><strong>An adaptive and functional programming language</strong></p>
</div>

## About

This crate provides a PEG parser with the following features:
* Support for left recursion
* Adaptation: The grammar can be changed dynamically during parsing

This crate is under heavy development and not yet ready to be used in production code.


## Example
This defines the grammar of a simple arithmetic language, and support to adapt the language: 
```
rule start = block;
rule block {
    b <- "grammar" "{" g:grammar(prule_action) "}" ";" b:#adapt(g, block);
    s :: b <- s:stmt ";" b:block;
    [] <- "";
}

rule stmt {
    Let(e) <- "let" e:expr;
    Do() <- "do";
}

rule expr {
    group additive {
        Add(x, y) <- x:#next "+" y:#this;
    }
    group multiplicative {
        Mul(x, y) <- x:#next "*" y:#this;
    }
    group base {
        Block(b) <- "(" b:block ")";
        UnaryMinus(v) <- "-" v:#this;
        Num(n) <- n:#str([0-9]*);
    }
}

rule layout = [' ' | '\n'];
```

Example programs in this language:
```
1 * 2 + -3
```
```
grammar {
    rule expr {
        group additive {
            1 + (-2) <- x:#next "-" y:#this;
        }
    }
};
1 - 2
```