anchor.diff:          while(!operatorBuffer.isEmpty && operatorBuffer.last.type != TokenType.LBRACE) {
             outputStream.add(operatorBuffer.removeLast());
           }
  -        
  +
           // Expect next token on stack to be left parenthesis and pop it
           if(operatorBuffer.isEmpty || operatorBuffer.removeLast().type != TokenType.LBRACE) {
             throw new StateError('Mismatched parenthesis.');
           }
  -        
  +
           // If the token at the top of the stack is a function token, pop it onto the output queue.
           if (!operatorBuffer.isEmpty && operatorBuffer.last.type.function) {
             outputStream.add(operatorBuffer.removeLast());
           }
         }
  -    }
  -    
  +      prevToken = curToken;
  +    }
  +
       /*
        * When the algorithm reaches the end of the input stream, we add the
        * tokens in the operatorBuffer to the outputStream. If the operator
  
positive.code:     result = 37 * result + type.hashCode;
      return result;
    }
    
    /// Creates a new Token with the given text and type.
    Token(String this.text, TokenType this.type);
  
  
negative.code:     while (iter.moveNext()) {
        String si = iter.currentAsString;
  
        /*
         * Check if the current Character is a keyword. If it is a keyword, check if the intBuffer is not empty and add
         * a Value Token for the intBuffer and the corresponding Token for the keyword.
         */
  