Mercurial > baum

comparison baum.1 @ 37:29172b6e802a

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
switched to next version number, updated man page
author meillo@marmaro.de
date Sat, 01 Mar 2008 17:55:42 +0100
parents 2e564bf8599c
children 233ac9bea4f1
comparison
equal deleted inserted replaced
36:b11ac43f3917 37:29172b6e802a
1 .TH baum 1 "2008-02-22" "baum 0.2" 1 .TH baum 1 "2008-03-01" "baum 0.3"
2 .SH NAME 2 .SH NAME
3 baum \- an esoteric programming language 3 baum \- an esoteric programming language
4 4
5 5
6 6
44 44
45 Source code are plain text files with one node per line representing the tree. The indention controls in which level in the tree the node is. Indention can be made with SPACE or with TAB characters. Every character means one level. 45 Source code are plain text files with one node per line representing the tree. The indention controls in which level in the tree the node is. Indention can be made with SPACE or with TAB characters. Every character means one level.
46 46
47 Empty lines and everything vom the hash symbol (`#') to the end of the line is ignored. 47 Empty lines and everything vom the hash symbol (`#') to the end of the line is ignored.
48 48
49 .B An example that echoes `42': 49 .B An example that echoes (and returns) `42':
50 50
51 .nf 51 .nf
52 # comment 52 # comment
53 print(0) 53 print(0)
54 sum(0) #comment 54 sum(0) #comment
62 62
63 baum programs are represented as nodes in a tree structure. Nodes are of specific kind and contain a value. 63 baum programs are represented as nodes in a tree structure. Nodes are of specific kind and contain a value.
64 64
65 The tree is processed recursive starting at the root node. Every node controls it's sons and should only know them; while most nodes only use their leftmost son. 65 The tree is processed recursive starting at the root node. Every node controls it's sons and should only know them; while most nodes only use their leftmost son.
66 66
67 Each node returns a value to it's parent. The internal value of the node could be used in any useful way, but only inside the node. 67 Each node returns a value to it's parent. (The root node returns an exit code to the shell.) The internal value of the node could be used in any useful way, but only inside the node.
68 68
69 All values in the language (return values, expected return values and in-node values) should be of the same type, so that every combination of nodes is possible. 69 All values in the language (return values, expected return values and in-node values) should be of the same type, so that every combination of nodes is possible.
70 70
71 Nodes can modify the tree, but should do this only on it's brothers or better only through it's rightmost brother. 71 Nodes can modify the tree, but should do this only on it's brothers or better only through it's rightmost brother.
72 72