anchor.diff:                      null
                   ),
       % Check that variables actually need to be defined before matching is done
  -    case DefL1 of
  +    case DefineL of
           [] -> InternalActual = Internal;
           _  -> InternalActual = assemble_sequence(
  -                            estree:variable_declaration(list_check(DefL1), <<"let">>),
  +                            estree:variable_declaration(list_check(DefineL), <<"let">>),
                               Internal
                           )
       end,
  
positive.code:                             [parse_node(noreturn,Params,M)]
                          )
                      ]),
                      lists:append(DefL2, recurse_var_assignments(
                          M,
                          estree:identifier(atom_to_binary(ParamName, utf8))
                      ))};
  
                  {V={c_var, _, ParamName}, {c_alias, _, {c_var, _, NewName}, M}}->
                      {lists:append(DefL1,
                          recurse_var_declaration(M)
                      ),
                      lists:append(MatchL,[
  
negative.code:             ]);
          _  -> ElseClausesActual = ElseClauses
      end,
      {DefineL, MatchL, AssignL} = extract_clause_snippets(Params,Vars,Match),
      % Assemble the if statement
      estree:if_statement(
          % The function that serves as pattern patching and guards
          assemble_case_condition(Params, {DefineL, MatchL, AssignL}, Evaluate),
          estree:block_statement(
              assemble_sequence(
                  estree:expression_statement(
  