Examples of org.apache.flex.compiler.tree.as.ITerminalNode

Package org.apache.flex.compiler.tree.as

Examples of org.apache.flex.compiler.tree.as.ITerminalNode

org.apache.flex.compiler.tree.as.ITerminalNode

An AST node representing a else clause in an if statement, a default clause in a switch statement, or a finally clause in a try statement.

The shape of this node is:

 ITerminalNode  IBlockNode <-- getStatementContentsNode()

Example 1:

 if (flag) doThis(); else doThat(); }

is represented as

 IIfNode IConditionalNode IIdentifierNode "flag" IBlockNode IFunctionCallNode ... ITerminalNode "else" IBlockNode IFunctionCallNode ...

Example 2:

 switch(i) { case 0: return a; default: return b; }

is represented as

 ISwitchNode IIdentifierNode "i" IBlockNode IConditionalNode INumericLiteralNode 0 IBlockNode IReturnNode IIdentifierNode "a" ITerminalNode "default" IBlockNode IReturnNode IIdentifierNode "b"

Example 3:

 finally { ... }

is represented as

 ITerminalNode "finally" IBlockNode ...


                getWalker().walk(enode.getChild(1)); // ConditionalNode
            }
        }


        ITerminalNode elseNode = node.getElseNode();
        if (elseNode != null)
        {
            IContainerNode cnode = (IContainerNode) elseNode.getChild(0);
            // if an implicit if, add a newline with no space
            final boolean isImplicit = isImplicit(cnode);
            if (isImplicit)
                writeNewline();
            else

View Full Code Here

        getWalker().walk(node.getChild(0));
        writeToken(ASEmitterTokens.PAREN_CLOSE);
        writeNewline(ASEmitterTokens.BLOCK_OPEN, true);


        IConditionalNode[] cnodes = ASNodeUtils.getCaseNodes(node);
        ITerminalNode dnode = ASNodeUtils.getDefaultNode(node);


        for (int i = 0; i < cnodes.length; i++)
        {
            IConditionalNode casen = cnodes[i];
            IContainerNode cnode = (IContainerNode) casen.getChild(1);
            writeToken(ASEmitterTokens.CASE);
            getWalker().walk(casen.getConditionalExpressionNode());
            write(ASEmitterTokens.COLON);
            if (!isImplicit(cnode))
                write(ASEmitterTokens.SPACE);
            getWalker().walk(casen.getStatementContentsNode());
            if (i == cnodes.length - 1 && dnode == null)
            {
                indentPop();
                writeNewline();
            }
            else
                writeNewline();
        }
        if (dnode != null)
        {
            IContainerNode cnode = (IContainerNode) dnode.getChild(0);
            write(ASEmitterTokens.DEFAULT);
            write(ASEmitterTokens.COLON);
            if (!isImplicit(cnode))
                write(ASEmitterTokens.SPACE);
            getWalker().walk(dnode);

View Full Code Here

        getWalker().walk(node.getStatementContentsNode());
        for (int i = 0; i < node.getCatchNodeCount(); i++)
        {
            getWalker().walk(node.getCatchNode(i));
        }
        ITerminalNode fnode = node.getFinallyNode();
        if (fnode != null)
        {
            write(ASEmitterTokens.SPACE);
            writeToken(ASEmitterTokens.FINALLY);
            getWalker().walk(fnode);

View Full Code Here


                getWalker().walk(enode.getChild(1)); // ConditionalNode
            }
        }


        ITerminalNode elseNode = node.getElseNode();
        if (elseNode != null)
        {
            IContainerNode cnode = (IContainerNode) elseNode.getChild(0);
            // if an implicit if, add a newline with no space
            final boolean isImplicit = isImplicit(cnode);
            if (isImplicit)
                writeNewline();
            else

View Full Code Here

        getWalker().walk(node.getChild(0));
        writeToken(ASEmitterTokens.PAREN_CLOSE);
        writeNewline(ASEmitterTokens.BLOCK_OPEN, true);


        IConditionalNode[] cnodes = ASNodeUtils.getCaseNodes(node);
        ITerminalNode dnode = ASNodeUtils.getDefaultNode(node);


        for (int i = 0; i < cnodes.length; i++)
        {
            IConditionalNode casen = cnodes[i];
            IContainerNode cnode = (IContainerNode) casen.getChild(1);
            writeToken(ASEmitterTokens.CASE);
            getWalker().walk(casen.getConditionalExpressionNode());
            write(ASEmitterTokens.COLON);
            if (!isImplicit(cnode))
                write(ASEmitterTokens.SPACE);
            getWalker().walk(casen.getStatementContentsNode());
            if (i == cnodes.length - 1 && dnode == null)
            {
                indentPop();
                writeNewline();
            }
            else
                writeNewline();
        }
        if (dnode != null)
        {
            IContainerNode cnode = (IContainerNode) dnode.getChild(0);
            write(ASEmitterTokens.DEFAULT);
            write(ASEmitterTokens.COLON);
            if (!isImplicit(cnode))
                write(ASEmitterTokens.SPACE);
            getWalker().walk(dnode);

View Full Code Here

        getWalker().walk(node.getStatementContentsNode());
        for (int i = 0; i < node.getCatchNodeCount(); i++)
        {
            getWalker().walk(node.getCatchNode(i));
        }
        ITerminalNode fnode = node.getFinallyNode();
        if (fnode != null)
        {
            write(ASEmitterTokens.SPACE);
            writeToken(ASEmitterTokens.FINALLY);
            getWalker().walk(fnode);

View Full Code Here


                getWalker().walk(enode.getChild(1)); // ConditionalNode
            }
        }


        ITerminalNode elseNode = node.getElseNode();
        if (elseNode != null)
        {
            IContainerNode cnode = (IContainerNode) elseNode.getChild(0);
            // if an implicit if, add a newline with no space
            final boolean isImplicit = isImplicit(cnode);
            if (isImplicit)
                write("\n");
            else

View Full Code Here

        write(" {");
        indentPush();
        write("\n");


        IConditionalNode[] cnodes = getCaseNodes(node);
        ITerminalNode dnode = getDefaultNode(node);


        for (int i = 0; i < cnodes.length; i++)
        {
            IConditionalNode casen = cnodes[i];
            IContainerNode cnode = (IContainerNode) casen.getChild(1);
            write("case");
            write(" ");
            getWalker().walk(casen.getConditionalExpressionNode());
            write(":");
            if (!isImplicit(cnode))
                write(" ");
            getWalker().walk(casen.getStatementContentsNode());
            if (i == cnodes.length - 1 && dnode == null)
            {
                indentPop();
                write("\n");
            }
            else
                write("\n");
        }
        if (dnode != null)
        {
            IContainerNode cnode = (IContainerNode) dnode.getChild(0);
            write("default");
            write(":");
            if (!isImplicit(cnode))
                write(" ");
            getWalker().walk(dnode);

View Full Code Here

        getWalker().walk(node.getStatementContentsNode());
        for (int i = 0; i < node.getCatchNodeCount(); i++)
        {
            getWalker().walk(node.getCatchNode(i));
        }
        ITerminalNode fnode = node.getFinallyNode();
        if (fnode != null)
        {
            write(" ");
            write("finally");
            write(" ");

View Full Code Here

TOP

Related Classes of org.apache.flex.compiler.tree.as.ITerminalNode

org.apache.flex.compiler.internal.as.codegen.ASEmitter

org.apache.flex.compiler.internal.codegen.as.ASEmitter

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.