Small edit to doc.
Chris Pressey
6 years ago
0 | 0 | Wanda |
1 | 1 | ===== |
2 | 2 | |
3 | Wanda is a Forth-like language with string-rewriting semantics, | |
4 | meaning it is arguably not fair to call it "concatenative", | |
5 | or even "stack-based". (For a more detailed explanation of what | |
6 | these things mean, see the Tutorial section.) | |
3 | Wanda is a Forth-like language. Despite being Forth-like, it | |
4 | is arguably not fair to call it "concatenative", or even | |
5 | "stack-based", because it is based on a string-rewriting semantics. | |
6 | ||
7 | The remainder of this document will describe the language and | |
8 | will attempt to elucidate the above statement. | |
7 | 9 | |
8 | 10 | Basics |
9 | 11 | ------ |
38 | 40 | |
39 | 41 | 2 + |
40 | 42 | ===> 2 + |
43 | ||
44 | So, we see that, despite looking like and evaluating | |
45 | like a Forth program, there is no stack separate from | |
46 | the program. "2" is not an instruction that pushes | |
47 | the value 2 onto the stack, it's just a "2". | |
48 | ||
49 | It's all just a string which gets rewritten. | |
41 | 50 | |
42 | 51 | ### Some other builtins |
43 | 52 |