Examples of BackRefNode

org.joni.ast.BackRefNode
org.jruby.ast.BackRefNode
Regexp back reference: - $& last successful match - $+ highest numbered group matched in last successful match. - $` what precedes the last successful match - $' what follows the last successful match

Examples of org.joni.ast.BackRefNode

        addAbsAddr(0); /*dummy addr.*/
    }


    @Override
    protected void compileBackrefNode(BackRefNode node) {
        BackRefNode br = node;
        if (Config.USE_BACKREF_WITH_LEVEL && br.isNestLevel()) {
            addOpcode(OPCode.BACKREF_WITH_LEVEL);
            addOption(regex.options & Option.IGNORECASE);
            addLength(br.nestLevel);
            // !goto add_bacref_mems;!
            addLength(br.backNum);

View Full Code Here

Examples of org.joni.ast.BackRefNode

        case NodeType.CANY:
            len = OPSize.OPCODE;
            break;


        case NodeType.BREF:
            BackRefNode br = (BackRefNode)node;


            if (Config.USE_BACKREF_WITH_LEVEL && br.isNestLevel()) {
                len = OPSize.OPCODE + OPSize.OPTION + OPSize.LENGTH +
                      OPSize.LENGTH + (OPSize.MEMNUM * br.backNum);
            } else { // USE_BACKREF_AT_LEVEL
                if (br.backNum == 1) {
                    len = ((!isIgnoreCase(regex.options) && br.back[0] <= 2)

View Full Code Here

Examples of org.joni.ast.BackRefNode

        case NodeType.ENCLOSE:
            numberedRefCheck(((EncloseNode)node).target);
            break;


        case NodeType.BREF:
            BackRefNode br = (BackRefNode)node;
            if (!br.isNameRef()) newValueException(ERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED);
            break;
        } // switch
    }

View Full Code Here

Examples of org.joni.ast.BackRefNode

    private int getMinMatchLength(Node node) {
        int min = 0;


        switch (node.getType()) {
        case NodeType.BREF:
            BackRefNode br = (BackRefNode)node;
            if (br.isRecursion()) break;


            if (br.back[0] > env.numMem) {
                if (!syntax.op2OptionECMAScript()) newValueException(ERR_INVALID_BACKREF);
            } else {
                min = getMinMatchLength(env.memNodes[br.back[0]]);

View Full Code Here

Examples of org.joni.ast.BackRefNode

        case NodeType.CANY:
            max = enc.maxLengthDistance();
            break;


        case NodeType.BREF:
            BackRefNode br = (BackRefNode)node;
            if (br.isRecursion()) {
                max = MinMaxLen.INFINITE_DISTANCE;
                break;
            }


            for (int i=0; i<br.backNum; i++) {

View Full Code Here

Examples of org.joni.ast.BackRefNode


        case NodeType.CALL: // if (Config.USE_SUBEXP_CALL) ?
            break;


        case NodeType.BREF:
            BackRefNode br = (BackRefNode)node;
            for (int i=0; i<br.backNum; i++) {
                if (br.back[i] > env.numMem) {
                    if (!syntax.op2OptionECMAScript()) newValueException(ERR_INVALID_BACKREF);
                } else {
                    env.backrefedMem = bsOnAt(env.backrefedMem, br.back[i]);
                    env.btMemStart = bsOnAt(env.btMemStart, br.back[i]);
                    if (Config.USE_BACKREF_WITH_LEVEL) {
                        if (br.isNestLevel()) {
                            env.btMemEnd = bsOnAt(env.btMemEnd, br.back[i]);
                        }
                    } // USE_BACKREF_AT_LEVEL
                    ((EncloseNode)env.memNodes[br.back[i]]).setMemBackrefed();
                }

View Full Code Here

Examples of org.joni.ast.BackRefNode

            } // inner switch
            break;
        }


        case NodeType.BREF: {
            BackRefNode br = (BackRefNode)node;


            if (br.isRecursion()) {
                opt.length.set(0, MinMaxLen.INFINITE_DISTANCE);
                break;
            }


            Node[]nodes = oenv.scanEnv.memNodes;

View Full Code Here

Examples of org.joni.ast.BackRefNode

                    }
                }
                if (shouldIgnore) {
                    node = StringNode.EMPTY;
                } else {
                    node = new BackRefNode(token.getBackrefNum(),
                                    new int[]{token.getBackrefRef1()},
                                    token.getBackrefByName(),
                                    token.getBackrefExistLevel(), // #ifdef USE_BACKREF_AT_LEVEL
                                    token.getBackrefLevel(),      // ...
                                    env);
                }
            } else {
                int[]backRefs = token.getBackrefNum() > 1 ? token.getBackrefRefs() : new int[]{token.getBackrefRef1()};
                node = new BackRefNode(token.getBackrefNum(),
                                backRefs,
                                token.getBackrefByName(),
                                token.getBackrefExistLevel(), // #ifdef USE_BACKREF_AT_LEVEL
                                token.getBackrefLevel(),      // ...
                                env);

View Full Code Here

Examples of org.jruby.ast.BackRefNode


        context.getInvocationCompiler().invokeAttrAssignMasgn(attrAssignNode.getName(), receiverCallback, argsCallback);
    }


    public void compileBackref(Node node, BodyCompiler context) {
        BackRefNode iVisited = (BackRefNode) node;


        context.performBackref(iVisited.getType());
    }

View Full Code Here

Examples of org.jruby.ast.BackRefNode

            if (last_state == LexState.EXPR_FNAME) {
                yaccValue = new Token("$" + (char) c, Tokens.tGVAR, getPosition());
                return Tokens.tGVAR;
            }
            
            yaccValue = new BackRefNode(getPosition(), c);
            return Tokens.tBACK_REF;


        case '1': case '2': case '3': case '4': case '5': case '6':
        case '7': case '8': case '9':
            tokenBuffer.setLength(0);

View Full Code Here

0 1

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.