anchor.diff:  %%% - Recursively generate a list of variable declarations --------------------------------------%%%
   %%% ---------------------------------------------------------------------------------------------%%%
   recurse_var_declaration({c_var, _, Name}) ->
  -    [estree:variable_declarator(estree:identifier(atom_to_binary(Name, utf8)), estree:identifier(<<"null">>))];
  +    [estree:variable_declarator(
  +        estree:identifier(atom_to_binary(Name, utf8)),
  +        estree:identifier(<<"null">>)
  +    )];
   recurse_var_declaration({c_literal, _, Name}) ->
       [];
   recurse_var_declaration({c_tuple, _, Elements}) ->
  
positive.code: % This one detects that a list constructor ends with a tail binding
  recurse_var_assignments(ConsCount, {c_cons, _, A, B={c_var, _, Name}}, V, _) ->
      lists:append(
          recurse_var_assignments(0, A, estree:member_expression(V, estree:literal(ConsCount), true), false),
          recurse_var_assignments(ConsCount+1, B, V, isTail)
      );
  recurse_var_assignments(ConsCount, {c_cons, _, A, B}, V, _) ->
      lists:append(
          recurse_var_assignments(0, A, estree:member_expression(V, estree:literal(ConsCount), true), false),
          recurse_var_assignments(ConsCount+1, B, V, false)
      );
  recurse_var_assignments(_ConsCount, _, _V, _) ->
  
negative.code: %% module export information.
  parse_module({c_module, _A, {_, _, ModuleName}, Exports, _Attributes, Functions}) ->
      FormattedFunctions = parse_functions(Functions),
      FormattedExports = lists:map(
          fun({N, A}) ->{atom_to_list(N), A} end,
          tuple_list_get_vars_3(Exports)
      ),
      esast:c_module(atom_to_list(ModuleName), FormattedExports, FormattedFunctions);
  parse_module(T) ->
      io:format("Unrecognised Token in module section: ~p", [T]).
  