anchor.diff:                      Transitions =
                           // Add the unvisited transition targets to the transition graph.
                           (compilationState.Transitions, transitionsFromCurrentDfaState)
  -                        ||> Map.fold (fun transitions derivativeClass target ->
  +                        ||> HashMap.fold (fun transitions derivativeClass target ->
                               LexerDfaGraph.addEdges currentState target derivativeClass transitions); }
   
               // Continue processing recursively.
  
positive.code: 
              //
              let transitionsFromCurrentDfaState =
                  Map.add derivativeClass targetDfaState transitionsFromCurrentDfaState
  
              transitionsFromCurrentDfaState,
              unvisitedTransitionTargets,
  
negative.code:     RegularVectorToDfaState : HashMap<RegularVector, DfaStateId>;
      /// Maps a DFA state to the regular vector it represents.
      // OPTIMIZE : Use the TagMap type from ExtCore.
      DfaStateToRegularVector : TagMap<DfaState, RegularVector>;
  }
  
  /// Functional operators related to the CompilationState record.
  