1.1 --- a/baum.1	Sat Mar 01 17:51:25 2008 +0100
     1.2 +++ b/baum.1	Sat Mar 01 17:55:42 2008 +0100
     1.3 @@ -1,4 +1,4 @@
     1.4 -.TH baum 1 "2008-02-22" "baum 0.2"
     1.5 +.TH baum 1 "2008-03-01" "baum 0.3"
     1.6  .SH NAME
     1.7  baum \- an esoteric programming language
     1.8  
     1.9 @@ -46,7 +46,7 @@
    1.10  
    1.11  Empty lines and everything vom the hash symbol (`#') to the end of the line is ignored.
    1.12  
    1.13 -.B An example that echoes `42':
    1.14 +.B An example that echoes (and returns) `42':
    1.15  
    1.16  .nf
    1.17  # comment
    1.18 @@ -64,7 +64,7 @@
    1.19  
    1.20  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.
    1.21  
    1.22 -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.
    1.23 +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.
    1.24  
    1.25  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.
    1.26