anchor.diff:              compute_states2(Seeds, N, Try, CurrState, StateTab, Tables);
           {merge, M, NewCurrent} ->
               %% io:fwrite(<<"Merging with state ~w\n">>, [M]),
  -            Try1 = case keysearch(M, 1, Try) of
  +            Try1 = case lists:keyfind(M, 1, Try) of
                          false ->
                              [{M, NewCurrent} | Try];
  -                       {value, {_, OldCurrent}} ->
  +                       {_, OldCurrent} ->
                              case ordsets:is_subset(NewCurrent, OldCurrent) of
                                  true ->
                                      Try;
  
positive.code: check_rhs([#symbol{name = '$empty'}], St) ->
      St;
  check_rhs(Rhs, St0) ->
      case symbol_search('$empty', Rhs) of
          {value, #symbol{line = Line}} ->
              add_error(Line, illegal_empty, St0);
          false ->
              foldl(fun(Sym, St) ->
  
negative.code:     map(fun(Symbol) -> Symbol#symbol.name end, Symbols).
  
  symbol_line(Name, St) ->
      #symbol{line = Line} = symbol_find(Name, St#yecc.all_symbols),
      Line.
  
  symbol_member(Symbol, Symbols) ->
      symbol_find(Symbol#symbol.name, Symbols) =/= false.
  
  symbol_find(Name, Symbols) ->
      lists:keyfind(Name, #symbol.name, Symbols).
  
  states_and_goto_table(St0) ->
      St1 = create_symbol_table(St0),
  