Function parseBinaryExpression

docs/app/js/sanddance-app.js:144319–144364

()

// 11.10 Binary Bitwise Operators
// 11.11 Binary Logical Operators
function parseBinaryExpression() {
    var marker, markers, expr, token, prec, stack, right, operator, left, i;
    marker = lookahead;
    left = parseUnaryExpression();
    token = lookahead;
    prec = binaryPrecedence(token);
    if (prec === 0) return left;
    token.prec = prec;
    lex();
    markers = [
        marker,
        lookahead
    ];
    right = parseUnaryExpression();
    stack = [
        left,
        token,
        right
    ];
    while((prec = binaryPrecedence(lookahead)) > 0){
        // Reduce: make a binary expression from the three topmost entries.
        while(stack.length > 2 && prec <= stack[stack.length - 2].prec){
            right = stack.pop();
            operator = stack.pop().value;
            left = stack.pop();
            markers.pop();
            expr = finishBinaryExpression(operator, left, right);
            stack.push(expr);
        } // Shift.
        token = lex();
        token.prec = prec;
        stack.push(token);
        markers.push(lookahead);
        expr = parseUnaryExpression();
        stack.push(expr);
    } // Final reduce to clean-up the stack.
    i = stack.length - 1;
    expr = stack[i];
    markers.pop();
    while(i > 1){
        markers.pop();
        expr = finishBinaryExpression(stack[i - 1].value, stack[i - 2], expr);
        i -= 2;
    }
    return expr;
} // 11.12 Conditional Operator
function parseConditionalExpression() {
    var expr, consequent, alternate;
    expr = parseBinaryExpression();