program ::= <ident> -> (<type>, <value>)

ident ::= function-identifier | identifier

type ::= "Typ von <ident>"

value ::= <initializer>
        | <compound-statement> ; Funktionsrumpf von <ident>

statement ::= <labeled-statement>
            | <compound-statement>
            | <expression-statement>
            | <selection-statement>
            | <iteration-statement>
            | <jump-statement>

labeled-statement ::= LABELED-STMT <ident> <statement>
                    | CASE <exp> <statement>
                    | DEFAULT <statement>

compound-statement ::= COMPOUND-STMT (<ident> -> (<type>, <value>)) <statement>*
                                 ; {  int i = 7;                    i+1; j+i; }
expression-statement ::= EXP-STMT <exp>

selection-statement ::= IF <exp> <exp> [<exp>]
                      | SWITCH <exp> <statement> ; für binäre Suche in den case-statements

iteration-statement ::= WHILE <exp> <exp> ; while (e1) e2;

jump-statement ::= GOTO <ident>
                 | CONTINUE
                 | BREAK
                 | RETURN [<exp>]

exp ::= EXPRESSION-SEQUENCE <exp> <exp>  ; e1 , e2
      | SELECT-EXPR <exp> <exp> <exp>    ; e1 ? e2 : e3
      | ASGN <exp> <exp>                 ; e1 = e2
      | CNST <const-value>               ; 4711 "hello" 'c' ...
      | POINTER-EXP (ADDR | INDIR <exp>)
      | UN-EXP <unary-exp>
      | BIN-EXP <binary-exp>
      | REL-EXP <relational-exp>
      | CONVERT-EXP (F | I | P | U) (F | I | P | U) <exp>

binary-exp ::= (MUL | DIV | MOD | ADD | SUB | LSH | RSH | BAND | BOR | BXOR) <exp> <exp>

unary-exp ::= (NEG | BCOM) <exp>

relational-exp ::= (LT | GT | LE | GE | NE | EQ) <exp> <exp>