Java Code Examples for jdk.nashorn.internal.runtime.regexp.joni.constants.TokenType#INTERVAL

The following examples show how to use jdk.nashorn.internal.runtime.regexp.joni.constants.TokenType#INTERVAL . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: Lexer.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
private void possessiveCheck() {
    if (left() && peekIs('+') &&
        (syntax.op2PlusPossessiveRepeat() && token.type != TokenType.INTERVAL ||
         syntax.op2PlusPossessiveInterval() && token.type == TokenType.INTERVAL)) {

        fetch();

        token.setRepeatGreedy(true);
        token.setRepeatPossessive(true);
    } else {
        token.setRepeatGreedy(true);
        token.setRepeatPossessive(false);
    }
}
Example 2
Source File: Parser.java    From openjdk-8 with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpRepeat(Node target, boolean group) {
    while (token.type == TokenType.OP_REPEAT || token.type == TokenType.INTERVAL) { // repeat:
        if (target.isInvalidQuantifier()) {
            throw new SyntaxException(ERR_TARGET_OF_REPEAT_OPERATOR_INVALID);
        }

        QuantifierNode qtfr = new QuantifierNode(token.getRepeatLower(),
                                                 token.getRepeatUpper(),
                                                 token.type == TokenType.INTERVAL);

        qtfr.greedy = token.getRepeatGreedy();
        int ret = qtfr.setQuantifier(target, group, env, chars, getBegin(), getEnd());
        Node qn = qtfr;

        if (token.getRepeatPossessive()) {
            EncloseNode en = new EncloseNode(EncloseType.STOP_BACKTRACK); // node_new_enclose
            en.setTarget(qn);
            qn = en;
        }

        if (ret == 0) {
            target = qn;
        } else if (ret == 2) { /* split case: /abc+/ */
            target = ConsAltNode.newListNode(target, null);
            ConsAltNode tmp = ((ConsAltNode)target).setCdr(ConsAltNode.newListNode(qn, null));

            fetchToken();
            return parseExpRepeatForCar(target, tmp, group);
        }
        fetchToken(); // goto re_entry
    }
    return target;
}
Example 3
Source File: Lexer.java    From nashorn with GNU General Public License v2.0 5 votes vote down vote up 
private void possessiveCheck() {
    if (left() && peekIs('+') &&
        (syntax.op2PlusPossessiveRepeat() && token.type != TokenType.INTERVAL ||
         syntax.op2PlusPossessiveInterval() && token.type == TokenType.INTERVAL)) {

        fetch();

        token.setRepeatGreedy(true);
        token.setRepeatPossessive(true);
    } else {
        token.setRepeatGreedy(true);
        token.setRepeatPossessive(false);
    }
}
Example 4
Source File: Lexer.java    From openjdk-8 with GNU General Public License v2.0 5 votes vote down vote up 
private void possessiveCheck() {
    if (left() && peekIs('+') &&
        (syntax.op2PlusPossessiveRepeat() && token.type != TokenType.INTERVAL ||
         syntax.op2PlusPossessiveInterval() && token.type == TokenType.INTERVAL)) {

        fetch();

        token.setRepeatGreedy(true);
        token.setRepeatPossessive(true);
    } else {
        token.setRepeatGreedy(true);
        token.setRepeatPossessive(false);
    }
}
Example 5
Source File: Parser.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpRepeat(final Node targetp, final boolean group) {
    Node target = targetp;
    while (token.type == TokenType.OP_REPEAT || token.type == TokenType.INTERVAL) { // repeat:
        if (target.isInvalidQuantifier()) {
            throw new SyntaxException(ERR_TARGET_OF_REPEAT_OPERATOR_INVALID);
        }

        final QuantifierNode qtfr = new QuantifierNode(token.getRepeatLower(),
                                                 token.getRepeatUpper(),
                                                 token.type == TokenType.INTERVAL);

        qtfr.greedy = token.getRepeatGreedy();
        final int ret = qtfr.setQuantifier(target, group, env, chars, getBegin(), getEnd());
        Node qn = qtfr;

        if (token.getRepeatPossessive()) {
            final EncloseNode en = new EncloseNode(EncloseType.STOP_BACKTRACK); // node_new_enclose
            en.setTarget(qn);
            qn = en;
        }

        if (ret == 0) {
            target = qn;
        } else if (ret == 2) { /* split case: /abc+/ */
            target = ConsAltNode.newListNode(target, null);
            final ConsAltNode tmp = ((ConsAltNode)target).setCdr(ConsAltNode.newListNode(qn, null));

            fetchToken();
            return parseExpRepeatForCar(target, tmp, group);
        }
        fetchToken(); // goto re_entry
    }
    return target;
}
Example 6
Source File: Lexer.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
private void possessiveCheck() {
    if (left() && peekIs('+') &&
        (syntax.op2PlusPossessiveRepeat() && token.type != TokenType.INTERVAL ||
         syntax.op2PlusPossessiveInterval() && token.type == TokenType.INTERVAL)) {

        fetch();

        token.setRepeatGreedy(true);
        token.setRepeatPossessive(true);
    } else {
        token.setRepeatGreedy(true);
        token.setRepeatPossessive(false);
    }
}
Example 7
Source File: Lexer.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
private void possessiveCheck() {
    if (left() && peekIs('+') &&
        (syntax.op2PlusPossessiveRepeat() && token.type != TokenType.INTERVAL ||
         syntax.op2PlusPossessiveInterval() && token.type == TokenType.INTERVAL)) {

        fetch();

        token.setRepeatGreedy(true);
        token.setRepeatPossessive(true);
    } else {
        token.setRepeatGreedy(true);
        token.setRepeatPossessive(false);
    }
}
Example 8
Source File: Parser.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpRepeat(final Node targetp, final boolean group) {
    Node target = targetp;
    while (token.type == TokenType.OP_REPEAT || token.type == TokenType.INTERVAL) { // repeat:
        if (target.isInvalidQuantifier()) {
            throw new SyntaxException(ERR_TARGET_OF_REPEAT_OPERATOR_INVALID);
        }

        final QuantifierNode qtfr = new QuantifierNode(token.getRepeatLower(),
                                                 token.getRepeatUpper(),
                                                 token.type == TokenType.INTERVAL);

        qtfr.greedy = token.getRepeatGreedy();
        final int ret = qtfr.setQuantifier(target, group, env, chars, getBegin(), getEnd());
        Node qn = qtfr;

        if (token.getRepeatPossessive()) {
            final EncloseNode en = new EncloseNode(EncloseType.STOP_BACKTRACK); // node_new_enclose
            en.setTarget(qn);
            qn = en;
        }

        if (ret == 0) {
            target = qn;
        } else if (ret == 2) { /* split case: /abc+/ */
            target = ConsAltNode.newListNode(target, null);
            final ConsAltNode tmp = ((ConsAltNode)target).setCdr(ConsAltNode.newListNode(qn, null));

            fetchToken();
            return parseExpRepeatForCar(target, tmp, group);
        }
        fetchToken(); // goto re_entry
    }
    return target;
}
Example 9
Source File: Parser.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpRepeat(final Node targetp, final boolean group) {
    Node target = targetp;
    while (token.type == TokenType.OP_REPEAT || token.type == TokenType.INTERVAL) { // repeat:
        if (target.isInvalidQuantifier()) {
            throw new SyntaxException(ERR_TARGET_OF_REPEAT_OPERATOR_INVALID);
        }

        final QuantifierNode qtfr = new QuantifierNode(token.getRepeatLower(),
                                                 token.getRepeatUpper(),
                                                 token.type == TokenType.INTERVAL);

        qtfr.greedy = token.getRepeatGreedy();
        final int ret = qtfr.setQuantifier(target, group, env, chars, getBegin(), getEnd());
        Node qn = qtfr;

        if (token.getRepeatPossessive()) {
            final EncloseNode en = new EncloseNode(EncloseType.STOP_BACKTRACK); // node_new_enclose
            en.setTarget(qn);
            qn = en;
        }

        if (ret == 0) {
            target = qn;
        } else if (ret == 2) { /* split case: /abc+/ */
            target = ConsAltNode.newListNode(target, null);
            final ConsAltNode tmp = ((ConsAltNode)target).setCdr(ConsAltNode.newListNode(qn, null));

            fetchToken();
            return parseExpRepeatForCar(target, tmp, group);
        }
        fetchToken(); // goto re_entry
    }
    return target;
}
Example 10
Source File: Parser.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpRepeat(final Node targetp, final boolean group) {
    Node target = targetp;
    while (token.type == TokenType.OP_REPEAT || token.type == TokenType.INTERVAL) { // repeat:
        if (target.isInvalidQuantifier()) {
            throw new SyntaxException(ERR_TARGET_OF_REPEAT_OPERATOR_INVALID);
        }

        final QuantifierNode qtfr = new QuantifierNode(token.getRepeatLower(),
                                                 token.getRepeatUpper(),
                                                 token.type == TokenType.INTERVAL);

        qtfr.greedy = token.getRepeatGreedy();
        final int ret = qtfr.setQuantifier(target, group, env, chars, getBegin(), getEnd());
        Node qn = qtfr;

        if (token.getRepeatPossessive()) {
            final EncloseNode en = new EncloseNode(EncloseType.STOP_BACKTRACK); // node_new_enclose
            en.setTarget(qn);
            qn = en;
        }

        if (ret == 0) {
            target = qn;
        } else if (ret == 2) { /* split case: /abc+/ */
            target = ConsAltNode.newListNode(target, null);
            final ConsAltNode tmp = ((ConsAltNode)target).setCdr(ConsAltNode.newListNode(qn, null));

            fetchToken();
            return parseExpRepeatForCar(target, tmp, group);
        }
        fetchToken(); // goto re_entry
    }
    return target;
}
Example 11
Source File: Parser.java    From jdk8u_nashorn with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpRepeat(final Node targetp, final boolean group) {
    Node target = targetp;
    while (token.type == TokenType.OP_REPEAT || token.type == TokenType.INTERVAL) { // repeat:
        if (target.isInvalidQuantifier()) {
            throw new SyntaxException(ERR_TARGET_OF_REPEAT_OPERATOR_INVALID);
        }

        final QuantifierNode qtfr = new QuantifierNode(token.getRepeatLower(),
                                                 token.getRepeatUpper(),
                                                 token.type == TokenType.INTERVAL);

        qtfr.greedy = token.getRepeatGreedy();
        final int ret = qtfr.setQuantifier(target, group, env, chars, getBegin(), getEnd());
        Node qn = qtfr;

        if (token.getRepeatPossessive()) {
            final EncloseNode en = new EncloseNode(EncloseType.STOP_BACKTRACK); // node_new_enclose
            en.setTarget(qn);
            qn = en;
        }

        if (ret == 0) {
            target = qn;
        } else if (ret == 2) { /* split case: /abc+/ */
            target = ConsAltNode.newListNode(target, null);
            final ConsAltNode tmp = ((ConsAltNode)target).setCdr(ConsAltNode.newListNode(qn, null));

            fetchToken();
            return parseExpRepeatForCar(target, tmp, group);
        }
        fetchToken(); // goto re_entry
    }
    return target;
}
Example 12
Source File: Lexer.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
private void possessiveCheck() {
    if (left() && peekIs('+') &&
        (syntax.op2PlusPossessiveRepeat() && token.type != TokenType.INTERVAL ||
         syntax.op2PlusPossessiveInterval() && token.type == TokenType.INTERVAL)) {

        fetch();

        token.setRepeatGreedy(true);
        token.setRepeatPossessive(true);
    } else {
        token.setRepeatGreedy(true);
        token.setRepeatPossessive(false);
    }
}
Example 13
Source File: Parser.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpRepeat(final Node targetp, final boolean group) {
    Node target = targetp;
    while (token.type == TokenType.OP_REPEAT || token.type == TokenType.INTERVAL) { // repeat:
        if (target.isInvalidQuantifier()) {
            throw new SyntaxException(ERR_TARGET_OF_REPEAT_OPERATOR_INVALID);
        }

        final QuantifierNode qtfr = new QuantifierNode(token.getRepeatLower(),
                                                 token.getRepeatUpper(),
                                                 token.type == TokenType.INTERVAL);

        qtfr.greedy = token.getRepeatGreedy();
        final int ret = qtfr.setQuantifier(target, group, env, chars, getBegin(), getEnd());
        Node qn = qtfr;

        if (token.getRepeatPossessive()) {
            final EncloseNode en = new EncloseNode(EncloseType.STOP_BACKTRACK); // node_new_enclose
            en.setTarget(qn);
            qn = en;
        }

        if (ret == 0) {
            target = qn;
        } else if (ret == 2) { /* split case: /abc+/ */
            target = ConsAltNode.newListNode(target, null);
            final ConsAltNode tmp = ((ConsAltNode)target).setCdr(ConsAltNode.newListNode(qn, null));

            fetchToken();
            return parseExpRepeatForCar(target, tmp, group);
        }
        fetchToken(); // goto re_entry
    }
    return target;
}
Example 14
Source File: Lexer.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * @return 0: normal {n,m}, 2: fixed {n}
 * !introduce returnCode here
 */
private int fetchRangeQuantifier() {
    mark();
    final boolean synAllow = syntax.allowInvalidInterval();

    if (!left()) {
        if (synAllow) {
            return 1; /* "....{" : OK! */
        }
        throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
    }

    if (!synAllow) {
        c = peek();
        if (c == ')' || c == '(' || c == '|') {
            throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
        }
    }

    int low = scanUnsignedNumber();
    if (low < 0) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }
    if (low > Config.MAX_REPEAT_NUM) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }

    boolean nonLow = false;
    if (p == _p) { /* can't read low */
        if (syntax.allowIntervalLowAbbrev()) {
            low = 0;
            nonLow = true;
        } else {
            return invalidRangeQuantifier(synAllow);
        }
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }

    fetch();
    int up;
    int ret = 0;
    if (c == ',') {
        final int prev = p; // ??? last
        up = scanUnsignedNumber();
        if (up < 0) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }
        if (up > Config.MAX_REPEAT_NUM) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }

        if (p == prev) {
            if (nonLow) {
                return invalidRangeQuantifier(synAllow);
            }
            up = QuantifierNode.REPEAT_INFINITE; /* {n,} : {n,infinite} */
        }
    } else {
        if (nonLow) {
            return invalidRangeQuantifier(synAllow);
        }
        unfetch();
        up = low; /* {n} : exact n times */
        ret = 2; /* fixed */
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }
    fetch();

    if (syntax.opEscBraceInterval()) {
        if (c != syntax.metaCharTable.esc) {
            return invalidRangeQuantifier(synAllow);
        }
        fetch();
    }

    if (c != '}') {
        return invalidRangeQuantifier(synAllow);
    }

    if (!isRepeatInfinite(up) && low > up) {
        throw new ValueException(ERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE);
    }

    token.type = TokenType.INTERVAL;
    token.setRepeatLower(low);
    token.setRepeatUpper(up);

    return ret; /* 0: normal {n,m}, 2: fixed {n} */
}
Example 15
Source File: Lexer.java    From nashorn with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * @return 0: normal {n,m}, 2: fixed {n}
 * !introduce returnCode here
 */
private int fetchRangeQuantifier() {
    mark();
    boolean synAllow = syntax.allowInvalidInterval();

    if (!left()) {
        if (synAllow) {
            return 1; /* "....{" : OK! */
        } else {
            throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
        }
    }

    if (!synAllow) {
        c = peek();
        if (c == ')' || c == '(' || c == '|') {
            throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
        }
    }

    int low = scanUnsignedNumber();
    if (low < 0) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }
    if (low > Config.MAX_REPEAT_NUM) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }

    boolean nonLow = false;
    if (p == _p) { /* can't read low */
        if (syntax.allowIntervalLowAbbrev()) {
            low = 0;
            nonLow = true;
        } else {
            return invalidRangeQuantifier(synAllow);
        }
    }

    if (!left()) return invalidRangeQuantifier(synAllow);

    fetch();
    int up;
    int ret = 0;
    if (c == ',') {
        int prev = p; // ??? last
        up = scanUnsignedNumber();
        if (up < 0) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }
        if (up > Config.MAX_REPEAT_NUM) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }

        if (p == prev) {
            if (nonLow) return invalidRangeQuantifier(synAllow);
            up = QuantifierNode.REPEAT_INFINITE; /* {n,} : {n,infinite} */
        }
    } else {
        if (nonLow) return invalidRangeQuantifier(synAllow);
        unfetch();
        up = low; /* {n} : exact n times */
        ret = 2; /* fixed */
    }

    if (!left()) return invalidRangeQuantifier(synAllow);
    fetch();

    if (syntax.opEscBraceInterval()) {
        if (c != syntax.metaCharTable.esc) return invalidRangeQuantifier(synAllow);
        fetch();
    }

    if (c != '}') return invalidRangeQuantifier(synAllow);

    if (!isRepeatInfinite(up) && low > up) {
        throw new ValueException(ERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE);
    }

    token.type = TokenType.INTERVAL;
    token.setRepeatLower(low);
    token.setRepeatUpper(up);

    return ret; /* 0: normal {n,m}, 2: fixed {n} */
}
Example 16
Source File: Lexer.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * @return 0: normal {n,m}, 2: fixed {n}
 * !introduce returnCode here
 */
private int fetchRangeQuantifier() {
    mark();
    final boolean synAllow = syntax.allowInvalidInterval();

    if (!left()) {
        if (synAllow) {
            return 1; /* "....{" : OK! */
        }
        throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
    }

    if (!synAllow) {
        c = peek();
        if (c == ')' || c == '(' || c == '|') {
            throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
        }
    }

    int low = scanUnsignedNumber();
    if (low < 0) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }
    if (low > Config.MAX_REPEAT_NUM) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }

    boolean nonLow = false;
    if (p == _p) { /* can't read low */
        if (syntax.allowIntervalLowAbbrev()) {
            low = 0;
            nonLow = true;
        } else {
            return invalidRangeQuantifier(synAllow);
        }
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }

    fetch();
    int up;
    int ret = 0;
    if (c == ',') {
        final int prev = p; // ??? last
        up = scanUnsignedNumber();
        if (up < 0) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }
        if (up > Config.MAX_REPEAT_NUM) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }

        if (p == prev) {
            if (nonLow) {
                return invalidRangeQuantifier(synAllow);
            }
            up = QuantifierNode.REPEAT_INFINITE; /* {n,} : {n,infinite} */
        }
    } else {
        if (nonLow) {
            return invalidRangeQuantifier(synAllow);
        }
        unfetch();
        up = low; /* {n} : exact n times */
        ret = 2; /* fixed */
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }
    fetch();

    if (syntax.opEscBraceInterval()) {
        if (c != syntax.metaCharTable.esc) {
            return invalidRangeQuantifier(synAllow);
        }
        fetch();
    }

    if (c != '}') {
        return invalidRangeQuantifier(synAllow);
    }

    if (!isRepeatInfinite(up) && low > up) {
        throw new ValueException(ERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE);
    }

    token.type = TokenType.INTERVAL;
    token.setRepeatLower(low);
    token.setRepeatUpper(up);

    return ret; /* 0: normal {n,m}, 2: fixed {n} */
}
Example 17
Source File: Lexer.java    From jdk8u_nashorn with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * @return 0: normal {n,m}, 2: fixed {n}
 * !introduce returnCode here
 */
private int fetchRangeQuantifier() {
    mark();
    final boolean synAllow = syntax.allowInvalidInterval();

    if (!left()) {
        if (synAllow) {
            return 1; /* "....{" : OK! */
        }
        throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
    }

    if (!synAllow) {
        c = peek();
        if (c == ')' || c == '(' || c == '|') {
            throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
        }
    }

    int low = scanUnsignedNumber();
    if (low < 0) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }
    if (low > Config.MAX_REPEAT_NUM) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }

    boolean nonLow = false;
    if (p == _p) { /* can't read low */
        if (syntax.allowIntervalLowAbbrev()) {
            low = 0;
            nonLow = true;
        } else {
            return invalidRangeQuantifier(synAllow);
        }
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }

    fetch();
    int up;
    int ret = 0;
    if (c == ',') {
        final int prev = p; // ??? last
        up = scanUnsignedNumber();
        if (up < 0) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }
        if (up > Config.MAX_REPEAT_NUM) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }

        if (p == prev) {
            if (nonLow) {
                return invalidRangeQuantifier(synAllow);
            }
            up = QuantifierNode.REPEAT_INFINITE; /* {n,} : {n,infinite} */
        }
    } else {
        if (nonLow) {
            return invalidRangeQuantifier(synAllow);
        }
        unfetch();
        up = low; /* {n} : exact n times */
        ret = 2; /* fixed */
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }
    fetch();

    if (syntax.opEscBraceInterval()) {
        if (c != syntax.metaCharTable.esc) {
            return invalidRangeQuantifier(synAllow);
        }
        fetch();
    }

    if (c != '}') {
        return invalidRangeQuantifier(synAllow);
    }

    if (!isRepeatInfinite(up) && low > up) {
        throw new ValueException(ERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE);
    }

    token.type = TokenType.INTERVAL;
    token.setRepeatLower(low);
    token.setRepeatUpper(up);

    return ret; /* 0: normal {n,m}, 2: fixed {n} */
}
Example 18
Source File: Lexer.java    From openjdk-jdk8u with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * @return 0: normal {n,m}, 2: fixed {n}
 * !introduce returnCode here
 */
private int fetchRangeQuantifier() {
    mark();
    final boolean synAllow = syntax.allowInvalidInterval();

    if (!left()) {
        if (synAllow) {
            return 1; /* "....{" : OK! */
        }
        throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
    }

    if (!synAllow) {
        c = peek();
        if (c == ')' || c == '(' || c == '|') {
            throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
        }
    }

    int low = scanUnsignedNumber();
    if (low < 0) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }
    if (low > Config.MAX_REPEAT_NUM) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }

    boolean nonLow = false;
    if (p == _p) { /* can't read low */
        if (syntax.allowIntervalLowAbbrev()) {
            low = 0;
            nonLow = true;
        } else {
            return invalidRangeQuantifier(synAllow);
        }
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }

    fetch();
    int up;
    int ret = 0;
    if (c == ',') {
        final int prev = p; // ??? last
        up = scanUnsignedNumber();
        if (up < 0) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }
        if (up > Config.MAX_REPEAT_NUM) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }

        if (p == prev) {
            if (nonLow) {
                return invalidRangeQuantifier(synAllow);
            }
            up = QuantifierNode.REPEAT_INFINITE; /* {n,} : {n,infinite} */
        }
    } else {
        if (nonLow) {
            return invalidRangeQuantifier(synAllow);
        }
        unfetch();
        up = low; /* {n} : exact n times */
        ret = 2; /* fixed */
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }
    fetch();

    if (syntax.opEscBraceInterval()) {
        if (c != syntax.metaCharTable.esc) {
            return invalidRangeQuantifier(synAllow);
        }
        fetch();
    }

    if (c != '}') {
        return invalidRangeQuantifier(synAllow);
    }

    if (!isRepeatInfinite(up) && low > up) {
        throw new ValueException(ERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE);
    }

    token.type = TokenType.INTERVAL;
    token.setRepeatLower(low);
    token.setRepeatUpper(up);

    return ret; /* 0: normal {n,m}, 2: fixed {n} */
}
Example 19
Source File: Lexer.java    From jdk8u60 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * @return 0: normal {n,m}, 2: fixed {n}
 * !introduce returnCode here
 */
private int fetchRangeQuantifier() {
    mark();
    final boolean synAllow = syntax.allowInvalidInterval();

    if (!left()) {
        if (synAllow) {
            return 1; /* "....{" : OK! */
        }
        throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
    }

    if (!synAllow) {
        c = peek();
        if (c == ')' || c == '(' || c == '|') {
            throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
        }
    }

    int low = scanUnsignedNumber();
    if (low < 0) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }
    if (low > Config.MAX_REPEAT_NUM) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }

    boolean nonLow = false;
    if (p == _p) { /* can't read low */
        if (syntax.allowIntervalLowAbbrev()) {
            low = 0;
            nonLow = true;
        } else {
            return invalidRangeQuantifier(synAllow);
        }
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }

    fetch();
    int up;
    int ret = 0;
    if (c == ',') {
        final int prev = p; // ??? last
        up = scanUnsignedNumber();
        if (up < 0) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }
        if (up > Config.MAX_REPEAT_NUM) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }

        if (p == prev) {
            if (nonLow) {
                return invalidRangeQuantifier(synAllow);
            }
            up = QuantifierNode.REPEAT_INFINITE; /* {n,} : {n,infinite} */
        }
    } else {
        if (nonLow) {
            return invalidRangeQuantifier(synAllow);
        }
        unfetch();
        up = low; /* {n} : exact n times */
        ret = 2; /* fixed */
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }
    fetch();

    if (syntax.opEscBraceInterval()) {
        if (c != syntax.metaCharTable.esc) {
            return invalidRangeQuantifier(synAllow);
        }
        fetch();
    }

    if (c != '}') {
        return invalidRangeQuantifier(synAllow);
    }

    if (!isRepeatInfinite(up) && low > up) {
        throw new ValueException(ERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE);
    }

    token.type = TokenType.INTERVAL;
    token.setRepeatLower(low);
    token.setRepeatUpper(up);

    return ret; /* 0: normal {n,m}, 2: fixed {n} */
}
Example 20
Source File: Lexer.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * @return 0: normal {n,m}, 2: fixed {n}
 * !introduce returnCode here
 */
private int fetchRangeQuantifier() {
    mark();
    final boolean synAllow = syntax.allowInvalidInterval();

    if (!left()) {
        if (synAllow) {
            return 1; /* "....{" : OK! */
        }
        throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
    }

    if (!synAllow) {
        c = peek();
        if (c == ')' || c == '(' || c == '|') {
            throw new SyntaxException(ERR_END_PATTERN_AT_LEFT_BRACE);
        }
    }

    int low = scanUnsignedNumber();
    if (low < 0) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }
    if (low > Config.MAX_REPEAT_NUM) {
        throw new SyntaxException(ErrorMessages.ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
    }

    boolean nonLow = false;
    if (p == _p) { /* can't read low */
        if (syntax.allowIntervalLowAbbrev()) {
            low = 0;
            nonLow = true;
        } else {
            return invalidRangeQuantifier(synAllow);
        }
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }

    fetch();
    int up;
    int ret = 0;
    if (c == ',') {
        final int prev = p; // ??? last
        up = scanUnsignedNumber();
        if (up < 0) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }
        if (up > Config.MAX_REPEAT_NUM) {
            throw new ValueException(ERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE);
        }

        if (p == prev) {
            if (nonLow) {
                return invalidRangeQuantifier(synAllow);
            }
            up = QuantifierNode.REPEAT_INFINITE; /* {n,} : {n,infinite} */
        }
    } else {
        if (nonLow) {
            return invalidRangeQuantifier(synAllow);
        }
        unfetch();
        up = low; /* {n} : exact n times */
        ret = 2; /* fixed */
    }

    if (!left()) {
        return invalidRangeQuantifier(synAllow);
    }
    fetch();

    if (syntax.opEscBraceInterval()) {
        if (c != syntax.metaCharTable.esc) {
            return invalidRangeQuantifier(synAllow);
        }
        fetch();
    }

    if (c != '}') {
        return invalidRangeQuantifier(synAllow);
    }

    if (!isRepeatInfinite(up) && low > up) {
        throw new ValueException(ERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE);
    }

    token.type = TokenType.INTERVAL;
    token.setRepeatLower(low);
    token.setRepeatUpper(up);

    return ret; /* 0: normal {n,m}, 2: fixed {n} */
}