Split parser into parser itself, opcodes dumper and syntax errors checker.

Add internal hash map of literal indexes:
  In this hash map key is pair of block number and literal's unique identifier in the block, and the value is a literal index that unique in the whole program.
  Block is a continues array of opcodes. So, bytecode is splitted into blocks.
  Each block has its own uid counter. To get literal index the interpreter looks up it in the hash map.
  Thus, now JS program is able to have more than 255 identifiers/string literals.
  The first 128 (0-127) uids are reserved for block's uid counter, the other 128 (128-255) are reserved for tmp variables.

src/liballocator/mem-heap.c

@@ -428,6 +428,8 @@ mem_heap_alloc_block (size_t size_in_bytes,           /**< size of region to all
   }
   else
   {
+    JERRY_ASSERT (alloc_term == MEM_HEAP_ALLOC_SHORT_TERM);
+    
     block_p = mem_heap.last_block_p;
     direction = MEM_DIRECTION_PREV;
   }