Java 类org.mozilla.javascript.ast.Block 实例源码

项目：HL4A 文件：Parser.java

private AstNode statements(AstNode parent) throws IOException {
    if (currentToken != Token.LC  // assertion can be invalid in bad code
        && !compilerEnv.isIdeMode()) codeBug();
    int pos = ts.tokenBeg;
    AstNode block = parent != null ? parent : new Block(pos);
    block.setLineno(ts.lineno);

    int tt;
    while ((tt = peekToken()) > Token.EOF && tt != Token.RC) {
        block.addChild(statement());
    }
    block.setLength(ts.tokenBeg - pos);
    return block;
}

项目：LoboEvolution 文件：Parser.java

private AstNode statements(AstNode parent) throws IOException {
    if (currentToken != Token.LC  // assertion can be invalid in bad code
        && !compilerEnv.isIdeMode()) codeBug();
    int pos = ts.tokenBeg;
    AstNode block = parent != null ? parent : new Block(pos);
    block.setLineno(ts.lineno);

    int tt;
    while ((tt = peekToken()) > Token.EOF && tt != Token.RC) {
        block.addChild(statement());
    }
    block.setLength(ts.tokenBeg - pos);
    return block;
}

项目：teavm 文件：AstWriter.java

private void print(Block node) throws IOException {
    writer.append('{').softNewLine().indent();
    for (Node child = node.getFirstChild(); child != null; child = child.getNext()) {
        print((AstNode) child);
        writer.softNewLine();
    }
    writer.outdent().append('}');
}

项目：HL4A 文件：IRFactory.java

private Node transformSwitch(SwitchStatement node) {
    // The switch will be rewritten from:
    //
    // switch (expr) {
    //   case test1: statements1;
    //   ...
    //   default: statementsDefault;
    //   ...
    //   case testN: statementsN;
    // }
    //
    // to:
    //
    // {
    //     switch (expr) {
    //       case test1: goto label1;
    //       ...
    //       case testN: goto labelN;
    //     }
    //     goto labelDefault;
    //   label1:
    //     statements1;
    //   ...
    //   labelDefault:
    //     statementsDefault;
    //   ...
    //   labelN:
    //     statementsN;
    //   breakLabel:
    // }
    //
    // where inside switch each "break;" without label will be replaced
    // by "goto breakLabel".
    //
    // If the original switch does not have the default label, then
    // after the switch he transformed code would contain this goto:
    //     goto breakLabel;
    // instead of:
    //     goto labelDefault;

    decompiler.addToken(Token.SWITCH);
    decompiler.addToken(Token.LP);
    Node switchExpr = transform(node.getExpression());
    decompiler.addToken(Token.RP);
    node.addChildToBack(switchExpr);

    Node block = new Node(Token.BLOCK, node, node.getLineno());
    decompiler.addEOL(Token.LC);

    for (SwitchCase sc : node.getCases()) {
        AstNode expr = sc.getExpression();
        Node caseExpr = null;

        if (expr != null) {
            decompiler.addToken(Token.CASE);
            caseExpr = transform(expr);
        } else {
            decompiler.addToken(Token.DEFAULT);
        }
        decompiler.addEOL(Token.COLON);

        List<AstNode> stmts = sc.getStatements();
        Node body = new Block();
        if (stmts != null) {
            for (AstNode kid : stmts) {
                body.addChildToBack(transform(kid));
            }
        }
        addSwitchCase(block, caseExpr, body);
    }
    decompiler.addEOL(Token.RC);
    closeSwitch(block);
    return block;
}

项目：SJS 文件：ConstraintVisitor.java

/**
 * This method generates constraints for all relevant AstNodes. It delegates its work to various
 * processXXX() methods that handle AstNodes of type XXX.
 */
@Override
public boolean visit(AstNode node) {
    if (node instanceof VariableInitializer){
        processVariableInitializer(node);
    } else if (node instanceof ReturnStatement){
        processReturnStatement((ReturnStatement)node);
    } else if (node instanceof ExpressionStatement){
        processExpressionStatement((ExpressionStatement)node);
    } else if (node instanceof ForLoop){
        processForLoop((ForLoop)node);
    } else if (node instanceof ForInLoop){
        processForInLoop((ForInLoop)node);
    }else if (node instanceof WhileLoop){
        processWhileLoop((WhileLoop)node);
    } else if (node instanceof DoLoop){
        processDoLoop((DoLoop)node);
    } else if (node instanceof NewExpression){
        processNewExpression((NewExpression)node);
    } else if (node instanceof FunctionCall){
        processFunctionCall((FunctionCall)node);
    } else if (node instanceof ElementGet){
        processElementGet((ElementGet)node);
    } else if (node instanceof FunctionNode){
        processFunctionNode((FunctionNode)node);
    } else if (node instanceof IfStatement){
        processIfStatement((IfStatement)node);
    } else if (node instanceof KeywordLiteral){
        processKeywordLiteral((KeywordLiteral)node);
    } else if (node instanceof SwitchStatement){
        processSwitchStatement((SwitchStatement)node);
    } else if (node instanceof SwitchCase){
        processSwitchCase((SwitchCase)node);
    } else if ((node instanceof AstRoot) || //AstRoot: no constraints need to be generated
        (node instanceof BreakStatement) || //BreakStatement: no constraints need to be generated
        (node instanceof VariableDeclaration) || //VariableDeclaration: we generate constraints for its constituent VariableInitializer nodes
        (node instanceof Name) || //Name: generate constraints for complex expressions that refer to names
        (node instanceof NumberLiteral) || //NumberLiteral: generate constraints for complex expressions that refer to names
        (node instanceof StringLiteral) || //StringLiteral: generate constraints for complex expressions that refer to names
        (node instanceof Assignment) || // Assignment is a special case of InfixExpression
        (node instanceof ArrayLiteral) ||
        (node instanceof UnaryExpression) ||
        (node instanceof InfixExpression) ||
        (node instanceof ConditionalExpression) ||
        (node instanceof ParenthesizedExpression) ||
        (node instanceof EmptyExpression) ||
        (node instanceof ObjectLiteral) ||
        (node instanceof EmptyStatement) ||
        (node instanceof ContinueStatement) ||
        (node instanceof Scope) ||
        (node instanceof Block)){ // // occurs in programs with for loops -- nothing to be done here?
        /* nothing */
    } else {
        error("unsupported node " + node.toSource().trim() + " of type: " + node.getClass().getName(), node);
    }
    return true;
}

项目：LoboEvolution 文件：IRFactory.java

private Node transformSwitch(SwitchStatement node) {
    // The switch will be rewritten from:
    //
    // switch (expr) {
    //   case test1: statements1;
    //   ...
    //   default: statementsDefault;
    //   ...
    //   case testN: statementsN;
    // }
    //
    // to:
    //
    // {
    //     switch (expr) {
    //       case test1: goto label1;
    //       ...
    //       case testN: goto labelN;
    //     }
    //     goto labelDefault;
    //   label1:
    //     statements1;
    //   ...
    //   labelDefault:
    //     statementsDefault;
    //   ...
    //   labelN:
    //     statementsN;
    //   breakLabel:
    // }
    //
    // where inside switch each "break;" without label will be replaced
    // by "goto breakLabel".
    //
    // If the original switch does not have the default label, then
    // after the switch he transformed code would contain this goto:
    //     goto breakLabel;
    // instead of:
    //     goto labelDefault;

    decompiler.addToken(Token.SWITCH);
    decompiler.addToken(Token.LP);
    Node switchExpr = transform(node.getExpression());
    decompiler.addToken(Token.RP);
    node.addChildToBack(switchExpr);

    Node block = new Node(Token.BLOCK, node, node.getLineno());
    decompiler.addEOL(Token.LC);

    for (SwitchCase sc : node.getCases()) {
        AstNode expr = sc.getExpression();
        Node caseExpr = null;

        if (expr != null) {
            decompiler.addToken(Token.CASE);
            caseExpr = transform(expr);
        } else {
            decompiler.addToken(Token.DEFAULT);
        }
        decompiler.addEOL(Token.COLON);

        List<AstNode> stmts = sc.getStatements();
        Node body = new Block();
        if (stmts != null) {
            for (AstNode kid : stmts) {
                body.addChildToBack(transform(kid));
            }
        }
        addSwitchCase(block, caseExpr, body);
    }
    decompiler.addEOL(Token.RC);
    closeSwitch(block);
    return block;
}