1 files changed, 18 insertions, 18 deletions

diff --git a/JPratt/src/main/java/bjc/pratt/commands/TernaryCommand.java b/JPratt/src/main/java/bjc/pratt/commands/TernaryCommand.java
index 0152471..2e12050 100644
--- a/JPratt/src/main/java/bjc/pratt/commands/TernaryCommand.java
+++ b/JPratt/src/main/java/bjc/pratt/commands/TernaryCommand.java
@@ -9,42 +9,43 @@ import bjc.utils.parserutils.ParserException;
 
 /**
  * A ternary command, like C's ?:
- * 
+ *
  * @author bjculkin
  *
  * @param <K>
  *                The key type of the tokens.
- * 
+ *
  * @param <V>
  *                The value type of the tokens.
- * 
+ *
  * @param <C>
  *                The state type of the parser.
  */
 public class TernaryCommand<K, V, C> extends BinaryPostCommand<K, V, C> {
-	private ParseBlock<K, V, C> innerBlck;
+	private final ParseBlock<K, V, C> innerBlck;
 
-	private Token<K, V> mark;
+	private final Token<K, V> mark;
 
-	private boolean nonassoc;
+	private final boolean nonassoc;
 
 	/**
 	 * Create a new ternary command.
-	 * 
+	 *
 	 * @param precedence
 	 *                The precedence of this operator.
-	 * 
+	 *
 	 * @param innerBlock
 	 *                The representation of the inner block of the
 	 *                expression.
-	 * 
+	 *
 	 * @param marker
 	 *                The token to use as the root of the AST node.
-	 * 
+	 *
 	 * @param isNonassoc
 	 *                Whether or not the conditional is associative.
 	 */
-	public TernaryCommand(int precedence, ParseBlock<K, V, C> innerBlock, Token<K, V> marker, boolean isNonassoc) {
+	public TernaryCommand(final int precedence, final ParseBlock<K, V, C> innerBlock, final Token<K, V> marker,
+			final boolean isNonassoc) {
 		super(precedence);
 
 		if (innerBlock == null)
@@ -57,20 +58,19 @@ public class TernaryCommand<K, V, C> extends BinaryPostCommand<K, V, C> {
 	}
 
 	@Override
-	public ITree<Token<K, V>> denote(ITree<Token<K, V>> operand, Token<K, V> operator, ParserContext<K, V, C> ctx)
-			throws ParserException {
-		ITree<Token<K, V>> inner = innerBlck.parse(ctx);
+	public ITree<Token<K, V>> denote(final ITree<Token<K, V>> operand, final Token<K, V> operator,
+			final ParserContext<K, V, C> ctx) throws ParserException {
+		final ITree<Token<K, V>> inner = innerBlck.parse(ctx);
 
-		ITree<Token<K, V>> outer = ctx.parse.parseExpression(1 + leftBinding(), ctx.tokens, ctx.state, false);
+		final ITree<Token<K, V>> outer = ctx.parse.parseExpression(1 + leftBinding(), ctx.tokens, ctx.state,
+				false);
 
 		return new Tree<>(mark, inner, operand, outer);
 	}
 
 	@Override
 	public int nextBinding() {
-		if (nonassoc) {
-			return leftBinding() - 1;
-		}
+		if (nonassoc) return leftBinding() - 1;
 
 		return leftBinding();
 	}