public static void turnNegationsIntoNegativeMultplication(LinkedList<Token> list) throws MalformedParenthesisException, MalformedDecimalException, InvalidOperandException, MalformedTokenException {
		
		//TODO: Add parenthesis around expressions that we modify
		
		//Create a parenthetical expression out of these tokens
		//This is the all the negations and the token that they
		//modify
		//<Negation><Negation>...<Negation><Token> --> (<Negation><Negation>...<Negation><Token>) 
		
		//go to the first instance of negation
		int i=0;
		int numberOfNegators;
		Integer firstInstanceOfNegation=null;
		
		while(i<list.size()) {
			numberOfNegators=0;
			firstInstanceOfNegation = getNextInstanceOfNegation(list, i);
			
			if(firstInstanceOfNegation==null)
				return;
			
			i=firstInstanceOfNegation;
			int j=firstInstanceOfNegation;
			while(list.get(j).getType()==TokenType.NEGATOR) {
				
				numberOfNegators++;
				j++;
			}
			
			//add a new expression made up of tokens
			//j++ represents the string including the token
			LinkedList<Token> newTokenList = new LinkedList<Token>();
				
			for(int p=0; p<numberOfNegators; p++) {
					newTokenList.add(2*p, new Token(-1));
					newTokenList.add(2*p + 1, new Token(Operation.MULTIPLICATION));
				}
					
			newTokenList.add(list.get(j));  //not getLast...getNEXT

			Expression e= new Expression(newTokenList);
			Double d = e.getExpressionValue();
			
			//Remove all but i
			for(int k = i+numberOfNegators; k> i ; k--) {
				
				list.remove(k);
			}

			Token t = new Token(d);
			if(t.getType()!=TokenType.NUMERIC)
				throw new MalformedTokenException();
			
			list.set(i, t);
			i++;
		}
	}