anchor.diff:  -type import_tab() :: gb_trees:tree(mfa(), index()).
   -type fname_tab()  :: #{Name :: term() => index()}.
   -type line_tab()   :: #{{Fname :: index(), Line :: term()} => index()}.
  --type literal_tab() :: dict:dict(Literal :: term(), index()).
  +-type literal_tab() :: #{Literal :: term() => index()}.
   
   -type lambda_info() :: {label(),{index(),label(),non_neg_integer()}}.
   -type lambda_tab() :: {non_neg_integer(),[lambda_info()]}.
  
positive.code: 	 strings = <<>>		    :: binary(),	%String pool
  	 lambdas = {0,[]}           :: lambda_tab(),
           wrappers = #{}             :: wrapper(),
  	 literals = dict:new()	    :: literal_tab(),
  	 fnames = #{}               :: fname_tab(),
  	 lines = #{}                :: line_tab(),
  	 num_lines = 0		    :: non_neg_integer(), %Number of line instructions
  
negative.code: -spec literal_table(bdict()) -> {non_neg_integer(), [[binary(),...]]}.
  
  literal_table(#asm{literals=Tab,next_literal=NumLiterals}) ->
      L0 = maps:fold(fun(Lit, Num, Acc) ->
  			   [{Num,my_term_to_binary(Lit)}|Acc]
  		   end, [], Tab),
      L1 = lists:sort(L0),
  