anchor.diff:                  // TODO : Remove any self-deriving positions -- these are always forbidden.
                   //|> Set.filter (fun dominator ->
   
  -            // Intersect the dominator set with the current free position set
  -            // to remove any positions which are NOT free.
  -            // TODO
  -            freePositions)
  +            // Combine this state's dominators with the existing set of
  +            // free positions using the exclusive disjunction (XOR) relation.
  +            exclusiveDisjunction (freePositions, dominators))
   
   
   // Simple LR (SLR) parser tables.
  
positive.code:         // If any states or transition-edges have been added, we need to recurse
          // and continue until we reach a fixpoint; otherwise, return the completed table.
          if tableGenState.ParserStates <> tableGenState'.ParserStates ||
              tableGenState.Table <> tableGenState'.Table then
              createTableImpl grammar tableGenState'
          else
              tableGenState
  
negative.code:             // Return the updated table-gen state.
              (),
              { tableGenState with
                  ActionTable = table; }
  
  
      //
  