anchor.diff:              let clause = ruleClauses.[i]
               match clause.Pattern with
               | Pattern pattern ->
  -                patterns.Add pattern
  +                patterns.Add (
  +                    (Int32WithMeasure i : RuleClauseIndex),
  +                    pattern)
               | EndOfFile ->
                   eofClauseIndices <-
                       Set.add (Int32WithMeasure i : RuleClauseIndex) eofClauseIndices
  
positive.code:             Map.add kvp.Key kvp.Value categoryMap)
  
  //
  let private rulePatternsToDfa (rulePatterns : RegularVector) (options : CompilationOptions) : LexerRuleDfa =
      // Preconditions
      if Array.isEmpty rulePatterns then
          invalidArg "rulePatterns" "The rule must contain at least one (1) pattern."
  
      // Determine which "universe" to use when compiling this
      // pattern based on the compilation settings.
  
negative.code:         // lowest index -- i.e., the rule which was declared earliest in the lexer definition.
          |> Map.map (fun _ -> Set.minElement)
  
      // Create a LexerDfa record from the compiled DFA.
      {   Transitions = compilationState.Transitions;
          RuleAcceptedByState = ruleAcceptedByDfaState;
          InitialState = initialDfaStateId; }
  
  