anchor.diff:          let compilationState : CompilationState<'Symbol> = {
               NfaStateSetToDfaState = Map.empty;
               DfaStateToNfaStateSet = Map.empty;
  -            Transitions = SparseGraph.empty;
  -            FinalStates = Map.empty; }
  +            Transitions = SparseGraph.empty; }
   
           // The initial DFA state.
           let initialState, compilationState =
  
positive.code:         NfaStateSetToDfaState : Map<Set<NfaStateId>, DfaStateId>;
          /// Maps a DFA state to the set of NFA states it represents.
          DfaStateToNfaStateSet : Map<DfaStateId, Set<NfaStateId>>;
          /// For each final (accepting) state of the DFA, specifies the index of
          /// the pattern it accepts. The index is the index into the Regex[]
          /// used to create the original NFA.
          FinalStates : Map<DfaStateId, int<RegexIndex>>;
      }
  
      //
  
negative.code: [<CompilationRepresentation(CompilationRepresentationFlags.ModuleSuffix)>]
  module FSharpLex.Dfa
  
  open System.Diagnostics
  open Graph
  open Nfa
  
  