meillo@18: .TH baum 1 "2008-02-13" "baum 0.1"
meillo@18: .SH NAME
meillo@18: baum \- an esoteric programming language
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: .SH SYNOPSIS
meillo@18: .B baum
meillo@18: [\-v]\ [\-c]\ <file>
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: .SH DESCRIPTION
meillo@18: .B baum
meillo@18: is an interpreter for the baum programming language which is an experiment to create an esoteric programming language.
meillo@18: 
meillo@18: Source code is a representation of a tree in which every node is a command or data.
meillo@18: 
meillo@18: baum is only an experiment and the functionality is (currently) very restricted.
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: .SH OPTIONS
meillo@18: 
meillo@18: .TP
meillo@18: .BI \-v
meillo@18: Verbose output
meillo@18: 
meillo@18: .TP
meillo@18: .BI \-c
meillo@18: Check source file for validity. Return 0 if source code is valid and something else otherwise.
meillo@18: 
meillo@18: .TP
meillo@18: .BI \-\-help
meillo@18: Print usage information
meillo@18: 
meillo@18: .TP
meillo@18: .BI \-\-version
meillo@18: Print version information
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: .SH SOURCE CODE
meillo@18: 
meillo@18: 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.
meillo@18: 
meillo@18: Empty lines and everything vom the hash symbol (`#') to the end of the line is ignored.
meillo@18: 
meillo@18: .B An example that echoes `42':
meillo@18: 
meillo@18: .nf
meillo@18: # comment
meillo@18: print(0)
meillo@18: 	sum(0)  #comment
meillo@18: 		number(40)
meillo@18: 		number(2)
meillo@18: .fi
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: .SH CONCEPT
meillo@18: 
meillo@18: baum programs are represented as nodes in a tree structure. Nodes are of specific kind and contain a value.
meillo@18: 
meillo@18: 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.
meillo@18: 
meillo@18: 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.
meillo@18: 
meillo@18: 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.
meillo@18: 
meillo@18: Nodes can modify the tree, but should do this only on it's brothers or better only through it's rightmost brother.
meillo@18: 
meillo@18: 
meillo@18: .SH ERRORS
meillo@18: 
meillo@18: .TP
meillo@18: .BI 1
meillo@18: common error
meillo@18: 
meillo@18: .TP
meillo@18: .BI 3
meillo@18: no or more than one source file given
meillo@18: 
meillo@18: .TP
meillo@18: .BI 4
meillo@18: invalid node
meillo@18: 
meillo@18: .TP
meillo@18: .BI 127
meillo@18: invalid command line options
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: .SH BUGS
meillo@18: Please report if you find some.
meillo@18: 
meillo@18: 
meillo@18: .SH CREDITS
meillo@18: Ju developed the idea of
meillo@18: .B baum
meillo@18: with me in a conversation. Actually it was his idea to use the tree as basic structure.
meillo@18: 
meillo@18: 
meillo@18: 
meillo@18: .SH AUTHOR
meillo@18: markus schnalke <meillo@marmaro.de> and julian forster