Nikita

Can I fork your Symta and play around with it? I want to find the perfect syntax for an imperative language.

sage

Ну можно?

>>3
BACK TO CHINA, CHINK!

>>1

You can. Source code is under BSD license. But it's a is a pre-alpha protype and design is nowhere near being finalized. I'm now struggling with making GC predictable, without losing most of the features. Probably would have to get rid of continuations and use stack-based architecture, because it is predicatable.

Anyway, the code on github supports only simple expressions, like
sum&0 [X@Xs] = X + sum.Xs

>>6
I fuckin love old symta

>>5
Thanks. I don't care about performance, just the syntax.

>>8

Yeah. I'm too lazy to describe syntax formally using BNF. But it's read basically just top 350 lines of symta.lisp. Function /read returns sexps. It also allows C/C++ constructions, with with excetption that funcall is f{}, instead of f(), allowing expressing stuff like

Object.method.method{with args}
while condition {
| statement 1
| statement 2
}


>>9
The `|` is a Python-like offside rule reader for stuff like

matix | 1 2 3
| 4 5 6
| 7 8 9

Xs map | 0 => 1
| 1 => 0


_{(stopping the dubsfaggot from dubsbumping)}