anchor.diff:      lists:foldl(fun(Elem,L)->
               lists:append(L,recurse_var_declaration(Elem))
           end,[],Elements);
  +
   recurse_var_declaration({c_cons,_,A,B})->
       lists:append(recurse_var_declaration(A),
       recurse_var_declaration(B)).
  
positive.code: %% This is essentially a list constructor.
  parse_cons(return,Params,{c_cons,_,A,B})->
      estree:return_statement(parse_cons(noreturn,Params,{c_cons,[],A,B}));
  parse_cons(noreturn,Params,{c_cons,_,A,B={c_cons,_,C,D}})->
      estree:new_expression(estree:identifier(<<"List">>),
          parse_cons_chain(noreturn,Params,{c_cons,[],A,B})
     );
  parse_cons(noreturn,Params,{c_cons,_,A,B})->
      estree:new_expression(estree:identifier(<<"List">>),[parse_node(noreturn,Params,A),parse_node(noreturn,Params,B)]).
  
  %% Parses a c_try node.
  %% For lack of a more apparent reason for the c_try token I'm treating it a superfluous encapsulation
  
negative.code:         %Continue as normal, passing the temp variable
          parse_case(ReturnAtom,Params,{c_case, [], {c_var,[],'_tempVar'}, Clauses})
      ).
  
  %% Parses c_clause nodes.
  parse_case_clauses(ReturnAtom,Params, Vars, [])->
  