Allow optimization of bytecode

[lausek]

Constructs that require labels

• expressions for logical short-circuit (And, Or)
• branches
• loops (break, continue)

Optimization cases

• constant expressions like 1 + 2 are not optimized:

10:    Pushc(0)
11:    Pushc(1)
12:    Add

• generator could merge these expressions in Branch conditions into Jt:

10:    ...
11:    Not
12:    Jf
13:    ...

• the generator often emits code like this at the end of Branch (doesn't happen anymore after introduction of LIR?):

25:    ...
26:    Jmp(27)
27:    ....

• dead code elimination. everything after offset 12 cannot be reached Eliminate dead-code #9:

func:
11:    Pushc(0)
12:    Ret
13:    Pushc(1)
14:    ...

Steps for implementation

• HIR is a confusing name. change it to HirUnit (?)
• update code to use module_builder.entry() instead of module_builder.add(ENTRY_POINT)
• update docs
• create new type Label
• create new type LirElement
• rename current LoweringRuntime to HirLoweringRuntime that transforms HIR -> LIR
  • on each emit try to optimize the last instructions (depending on instruction)
• create a new runtime LirLoweringRuntime that transforms LIR -> Bytecode