anchor.diff:          |> epsilonClosureImpl Set.empty nfa
   
       //
  -    type CompilationState<'Symbol when 'Symbol : comparison> = {
  +    type CompilationState = {
           //
           Transitions : LexerDfaGraph<DfaState>;
           /// Maps sets of NFA states to the DFA state representing the set.
  
positive.code:         dfaState, compilationState
  
      /// The main NFA -> DFA compilation function.
      let rec private compileRec (nfa : Nfa) (pending : Set<DfaStateId>) (compilationState : CompilationState<'Symbol>) =
          // If there are no more pending states, we're finished compiling the DFA.
          if Set.isEmpty pending then
              compilationState
  
negative.code:     //
      let compile (nfa : Nfa) : DfaCompilationResult =
          // The initial (empty) compilation state.
          let compilationState : CompilationState = {
              NfaStateSetToDfaState = Map.empty;
              DfaStateToNfaStateSet = Map.empty;
              Transitions = LexerDfaGraph.empty; }
  