anchor.diff:          lfe_internal:is_lfe_bif(F, Ar) orelse
           lfe_internal:is_erl_bif(F, Ar) of
           true -> St;
  -        false -> undefined_func_error(L, {F,Ar}, St)
  +        false -> undefined_function_error(L, {F,Ar}, St)
       end.
   
   %% check_body(Form, Body, Env, Line, State) -> State.
  
positive.code: check_import([from,Mod|Fs], L, St) when is_atom(Mod) ->
      Check = fun ([F,A], Imps, S) when is_atom(F), is_integer(A) ->
                      {orddict:store({F,A}, F, Imps),S};
                  (_, Imps, S) -> {Imps,bad_mdef_error(L, <<"import from">>, S)}
              end,
      check_import(Check, Mod, L, St, Fs);
  check_import([rename,Mod|Rs], L, St) when is_atom(Mod) ->
  
negative.code: %%  proper top list. Could easily and clearly be done with a Lisp
  %%  macro.
  
  check_foreach(Check, Err, St0, [F|Fs]) ->
      St1 = Check(F, St0),
      check_foreach(Check, Err, St1, Fs);
  check_foreach(_, _, St, []) -> St;
  check_foreach(_, Err, St, _) -> Err(St).
  
  check_foldl(Check, Err, Acc0, St0, [F|Fs]) ->
      {Acc1,St1} = Check(F, Acc0, St0),
      check_foldl(Check, Err, Acc1, St1, Fs);
  