anchor.diff:  module private FsLex =
       open System.CodeDom.Compiler
       open System.Text
  -    open LanguagePrimitives
       open BackendUtils.CodeGen
   
       (* TODO :   Given that each rule is compiled as it's own DFA and therefore won't ever transition
  
positive.code:                     if options.Unicode then
                          unicodeTransitionVectorElements (
                              compiledRule,
                              Int32WithMeasure ruleDfaStateId,
                              Int32WithMeasure baseDfaStateId,
                              indentingWriter)
                      else
                          asciiTransitionVectorElements (
                              compiledRule,
                              Int32WithMeasure ruleDfaStateId,
                              Int32WithMeasure baseDfaStateId,
                              indentingWriter)
  
                      // Emit the closing bracket of the transition vector for this state,
  
negative.code:             ||> Map.fold (fun combinedDfaStateCount _ compiledRule ->
                  combinedDfaStateCount + compiledRule.Dfa.Transitions.VertexCount)
  
          /// The maximum character value accepted by the combined DFA.
          let maxCharValue =
              /// The set of all valid input characters.
              let allValidInputChars =
                  // OPTIMIZE : We don't need to actually union the sets here, we can simply get
                  // the maximum value of each edge-set, then use the 'max' operator to combine them.
                  (CharSet.empty, compiledRules)
                  ||> Map.fold (fun allValidInputChars _ compiledRule ->
                      (allValidInputChars, compiledRule.Dfa.Transitions.AdjacencyMap)
                      ||> HashMap.fold (fun allValidInputChars _ edgeSet ->
                          CharSet.union allValidInputChars edgeSet))
              
              CharSet.maxElement allValidInputChars
  
          // Emit the 'let' binding for the fslex "Tables" object.
          "/// Interprets the transition and action tables of the lexer automaton."
  