package bjc.pratt.commands.impls; import bjc.pratt.ParserContext; import bjc.pratt.blocks.ParseBlock; import bjc.pratt.commands.BinaryPostCommand; import bjc.pratt.tokens.Token; import bjc.utils.data.ITree; import bjc.utils.data.Tree; import bjc.utils.parserutils.ParserException; /** * A ternary command, like C's ?: * * @author bjculkin * * @param * The key type of the tokens. * * @param * The value type of the tokens. * * @param * The state type of the parser. */ public class TernaryCommand extends BinaryPostCommand { private final ParseBlock innerBlck; private final Token mark; 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(final int precedence, final ParseBlock innerBlock, final Token marker, final boolean isNonassoc) { super(precedence); if (innerBlock == null) throw new NullPointerException("Inner block must not be null"); else if (marker == null) throw new NullPointerException("Marker must not be null"); innerBlck = innerBlock; mark = marker; nonassoc = isNonassoc; } @Override public ITree> denote(final ITree> operand, final Token operator, final ParserContext ctx) throws ParserException { final ITree> inner = innerBlck.parse(ctx); final ITree> 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; return leftBinding(); } }