Package org.mozilla.javascript.ast

Class Block

java.lang.Object
org.mozilla.javascript.Node
org.mozilla.javascript.ast.AstNode
org.mozilla.javascript.ast.Block
All Implemented Interfaces:
Comparable<AstNode>, Iterable<Node>
public class Block extends AstNode
A block statement delimited by curly braces. The node position is the position of the open-curly, and the length extends to the position of the close-curly. Node type is Token.BLOCK. 
Block :
     { Statement* }

  • Constructor Details

    • Block

      public Block()

    • Block

      public Block(int pos)

    • Block

      public Block(int pos, int len)

  • Method Details

    • addStatement

      public void addStatement(AstNode statement)
      Alias for AstNode.addChild(org.mozilla.javascript.ast.AstNode).

    • toSource

      public String toSource(int depth)
      Description copied from class: AstNode
      Emits source code for this node. Callee is responsible for calling this function recursively on children, incrementing indent as appropriate.

      Note: if the parser was in error-recovery mode, some AST nodes may have null children that are expected to be non-null when no errors are present. In this situation, the behavior of the toSource method is undefined: toSource implementations may assume that the AST node is error-free, since it is intended to be invoked only at runtime after a successful parse.

      Specified by:
      toSource in class AstNode
      Parameters:
      depth - the current recursion depth, typically beginning at 0 when called on the root node.

    • visit

      public void visit(NodeVisitor v)
      Description copied from class: AstNode
      Visits this node and its children in an arbitrary order.

      It's up to each node subclass to decide the order for processing its children. The subclass also decides (and should document) which child nodes are not passed to the NodeVisitor. For instance, nodes representing keywords like each or in may not be passed to the visitor object. The visitor can simply query the current node for these children if desired.

      Generally speaking, the order will be deterministic; the order is whatever order is decided by each child node. Normally child nodes will try to visit their children in lexical order, but there may be exceptions to this rule.

      Specified by:
      visit in class AstNode
      Parameters:
      v - the object to call with this node and its children