anchor.diff:  parse_case_clauses(ReturnAtom, Params, Vars, []) ->
       [];
   parse_case_clauses(ReturnAtom, Params, Vars, [{c_clause, _, Match, Evaluate, Consequent}|Clauses]) ->
  -    % {UnboundVars, ElseClauses} = parse_case_clauses(ReturnAtom, Params, Vars, Clauses), %alternate
       ElseClauses = parse_case_clauses(ReturnAtom, Params, Vars, Clauses), %alternate
       case ElseClauses of
           [] -> ElseClausesActual = null;
           _  -> ElseClausesActual = ElseClauses
       end,
  -    % {lists:append(declarators_from_list(Match), UnboundVars),
        estree:if_statement(
           assemble_case_condition(Params, Vars, Match, Evaluate), %test
           estree:block_statement(%consequent
  
positive.code: %%       Assignment from function?
  %%       Assignment with pattern matching?
  parse_apply(ReturnAtom, Params, {c_apply, _, {_, _, {FunctionName, Arity}}, Parameters}) ->
      % parse_node(ReturnAtom, Params, {c_call, [], {a, a, functions}, {a, a, FunctionName}, Parameters});
      parse_call(ReturnAtom, Params, {c_call, [], {a, a, functions}, {a, a, list_to_atom(atom_to_list(FunctionName) ++ "/" ++ integer_to_list(Arity))}, Parameters});
      % estree:call_expression(
      %      % estree:identifier(list_to_binary(atom_to_list(FunctionName) ++ "/" ++ integer_to_list(Arity))),
      %      estree:member_expression(
      %         estree:identifier(atom_to_binary(functions, utf8)),
      %         estree:literal(identify_normalise(atom_to_list(FunctionName) ++ "/" ++ integer_to_list(Arity))),
      %         true),
      %      lists:map(fun(T) -> parse_node(noreturn, Parameters, T) end, Parameters)
      %  );
  parse_apply(ReturnAtom, Params, {c_apply, _, {_, _, FunctionName}, Parameters}) ->
      parse_call(ReturnAtom, Params, {c_call, [], {a, a, functions}, {a, a, FunctionName}, Parameters}).
  
  
negative.code:     end, List).
  
  identify_normalise(N) ->
      list_to_binary(N).
  
  tup_to_list(Tuple) -> tup_to_list(Tuple, 1, tuple_size(Tuple)).
  