anchor.diff:  // Copyright (c) 2017 Theodore Tsirpanis
  -// 
  +//
   // This software is released under the MIT License.
   // https://opensource.org/licenses/MIT
   
  
positive.code:         | _ -> do ()
      }
  
      let lookAheadDFA state x =
          let rec impl state currPos currState lastAccept lastAccPos x =
              let newToken = state ^. ParserState.CurrentPosition_ |> Token.Create
              let newPos = currPos + 1u
              match x with
              | [] -> newToken Symbol.EOF ""
              | x :: xs ->
                  let dfaStates = state ^. ParserState.Grammar_ |> Grammar.dfa
                  let newDFA =
                      currState
                      |> DFAState.edges
  
negative.code: 
      open State
  
      let getLookAheadBuffer n x =
          let n = System.Math.Min(int n, Collections.List.length x)
          let x = x |> StateResult.eval (List.take n)
          match x with
          | Ok (x, _) -> x |> String.ofList
          | Bad _ -> ""
  