anchor.diff:          estree:block_statement(
               encapsulateExpressions(
                   listCheck(
  -                    parseFunctionBody(return,tupleList_getVars_3(ParamNames),Body)
  +                    parseNode(return,tupleList_getVars_3(ParamNames),Body)
                   )
               )
           ),
  
positive.code: %    Identifiers = tupleListToIdentifierList(Match,Params),
      Identifiers = lists:map(fun(Elem)->
              case Elem of
                  {c_alias,_,{c_var,_,Name},_Value} -> parseFunctionBody(noreturn,Params,{c_var,[],Name});
                  _ -> parseFunctionBody(noreturn,Params,Elem)
              end
          end,Match),
      estree:logical_expression(
  
negative.code: 
  %Parse the function body
  
  
  parseNode(ReturnAtom,Params,N)->
      case tuple_getVar_1(N) of
          c_call ->parseCall(ReturnAtom,Params,N);
          c_values ->parseValues(ReturnAtom,Params,N);
          c_var ->parseVar(ReturnAtom,Params,N);
          c_seq ->parseSeq(ReturnAtom,Params,N);
          c_let ->parseLet(ReturnAtom,Params,N);
          c_apply ->parseApply(ReturnAtom,Params,N);
          c_literal ->parseLiteral(ReturnAtom,Params,N);
          c_tuple ->parseTuple(ReturnAtom,Params,N);
          c_cons ->parseCons(ReturnAtom,Params,N);
          c_try ->parseTry(ReturnAtom,Params,N);
          c_primop ->parsePrimop(ReturnAtom,Params,N);
          c_letrec ->parseLetrec(ReturnAtom,Params,N);
          c_case ->parseCase(ReturnAtom,Params,N)
      end.
  
  
  parseCall(return,Params,{c_call, A, {B, C, Module}, {D, E, FunctionName}, Parameters})->
      estree:return_statement(parseCall(noreturn,Params,{c_call, A, {B, C, Module}, {D, E, FunctionName}, Parameters}));
  
  
  
  