# HG changeset patch
# User meillo@marmaro.de
# Date 1204390542 -3600
# Node ID 29172b6e802ad2c6d234ff8790785d8367f73717
# Parent  b11ac43f3917d51c12990e222eab82889ca94ef2
switched to next version number, updated man page

diff -r b11ac43f3917 -r 29172b6e802a baum.1
--- a/baum.1	Sat Mar 01 17:51:25 2008 +0100
+++ b/baum.1	Sat Mar 01 17:55:42 2008 +0100
@@ -1,4 +1,4 @@
-.TH baum 1 "2008-02-22" "baum 0.2"
+.TH baum 1 "2008-03-01" "baum 0.3"
 .SH NAME
 baum \- an esoteric programming language
 
@@ -46,7 +46,7 @@
 
 Empty lines and everything vom the hash symbol (`#') to the end of the line is ignored.
 
-.B An example that echoes `42':
+.B An example that echoes (and returns) `42':
 
 .nf
 # comment
@@ -64,7 +64,7 @@
 
 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.
 
-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.
+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.
 
 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.
 
diff -r b11ac43f3917 -r 29172b6e802a baum.c
--- a/baum.c	Sat Mar 01 17:51:25 2008 +0100
+++ b/baum.c	Sat Mar 01 17:55:42 2008 +0100
@@ -14,7 +14,7 @@
 #include "baum.h"
 #include "actions.h"
 
-#define VERSION "0.2"
+#define VERSION "0.3"
 
 
 int option_verbose = 0;