schala

Go to file

greg ae3a030ad8 Use iterative semantics for reduction Becuase if you try to make reduce() recursive you blow out the stack. Incidentally, "let a = 0; while a < 999999; let a = a + 1 end" is a neat thing to try at this stage of the game		2017-09-19 22:10:53 -07:00
src	Use iterative semantics for reduction	2017-09-19 22:10:53 -07:00
.gitignore	Initial commit	2017-09-19 22:10:51 -07:00
Cargo.toml	Initial commit	2017-09-19 22:10:51 -07:00
Grammar	Fixed arg list parsing	2017-09-19 22:10:53 -07:00
README	Working on binop parsing	2017-09-19 22:10:53 -07:00

README

No-runtime-value-error-language

A language wth a largely-python-like where there are no value errors. Can call null like a function



Grammar:

#comments are hashes
# newlines are equivalent to semicolons for breaking up statements

let a = 1.3; let b = "string literal"
let c = 2

if a < 3 then any(); number(); of(); exprs(); else whatever(); end

while condition; do(); whatever(); let a = 3; a; end

#function definition
fn my_function(arg1, arg2); statements(); end


Keywords:
if, then, else, while, let, fn, end, null


Parsing:

http://journal.stuffwithstuff.com/2011/03/19/pratt-parsers-expression-parsing-made-easy/