1 files changed, 83 insertions, 0 deletions
diff --git a/JPratt/src/main/java/com/ashardalon/pratt/commands/impls/ChainCommand.java b/JPratt/src/main/java/com/ashardalon/pratt/commands/impls/ChainCommand.java
new file mode 100644
index 0000000..5ba84ef
--- /dev/null
+++ b/JPratt/src/main/java/com/ashardalon/pratt/commands/impls/ChainCommand.java
@@ -0,0 +1,83 @@
+package com.ashardalon.pratt.commands.impls;
+
+import java.util.Set;
+
+import com.ashardalon.pratt.ParserContext;
+import com.ashardalon.pratt.commands.BinaryPostCommand;
+import com.ashardalon.pratt.commands.CommandResult;
+import com.ashardalon.pratt.commands.CommandResult.Status;
+import com.ashardalon.pratt.tokens.Token;
+
+import bjc.data.Tree;
+import bjc.data.SimpleTree;
+import bjc.utils.parserutils.ParserException;
+
+/**
+ * Create a new chained operator.
+ *
+ * @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 ChainCommand<K, V, C> extends BinaryPostCommand<K, V, C> {
+	private final Set<K> chainWith;
+
+	private final Token<K, V> chain;
+
+	/**
+	 * Create a new chained operator.
+	 *
+	 * @param precedence
+	 *        The precedence of this operator.
+	 *
+	 * @param chainSet
+	 *        The operators to chain with.
+	 *
+	 * @param chainMarker
+	 *        The token to use as the node in the AST.
+	 */
+	public ChainCommand(final int precedence, final Set<K> chainSet, final Token<K, V> chainMarker) {
+		super(precedence);
+
+		chainWith = chainSet;
+		chain = chainMarker;
+	}
+
+	@Override
+	public CommandResult<K, V> denote(final Tree<Token<K, V>> operand, final Token<K, V> operator,
+			final ParserContext<K, V, C> ctx) throws ParserException {
+		CommandResult<K, V> resOuter = ctx.parse.parseExpression(1 + leftBinding(), ctx.tokens, ctx.state,
+				false);
+		if (resOuter.status != Status.SUCCESS) return resOuter;
+		final Tree<Token<K, V>> tree = resOuter.success();
+
+		final Tree<Token<K, V>> res = new SimpleTree<>(operator, operand, tree);
+
+		if(chainWith.contains(ctx.tokens.current().getKey())) {
+			final Token<K, V> tok = ctx.tokens.current();
+			ctx.tokens.next();
+
+			CommandResult<K, V> resOther = denote(tree, tok,
+					new ParserContext<>(ctx.tokens, ctx.parse, ctx.state));
+			if (resOther.status != Status.SUCCESS) return resOther;
+			
+			final Tree<Token<K, V>> other = resOther.success();
+
+			return CommandResult.success(new SimpleTree<>(chain, res, other));
+		}
+
+		return CommandResult.success(res);
+	}
+
+	@Override
+	public int nextBinding() {
+		return leftBinding() - 1;
+	}
+}
+\ No newline at end of file