Examples of NodeChoice

lupos.rif.generated.syntaxtree.NodeChoice
Represents a grammar choice (|), e.g. ' ( A | B ) '.
The class stores the node and the "which" choice indicator (0, 1, ...).
sizzle.parser.syntaxtree.NodeChoice

Examples of lupos.rif.generated.syntaxtree.NodeChoice

  public Object visit(final RIFUniterm n, final IRuleNode argu) {
    final Uniterm term = new RulePredicate(false);
    term.setParent(argu);
    term.termName = (IExpression) n.f0.accept(this, term);
    for (final INode node : (List<INode>) n.f2.accept(this, term)) {
      final NodeChoice choice = (NodeChoice) node;
      if (choice.which == 1)
        term.termParams.add((IExpression) choice.choice.accept(this,
            term));
      else
        term.termParams.add((IExpression) ((List<INode>) choice.choice

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice

  @Override
  public String visit(final Program n, final SymbolTable argu) {
    final StringBuilder sb = new StringBuilder();


    for (final Node node : n.f0.nodes) {
      final NodeChoice nodeChoice = (NodeChoice) node;
      switch (nodeChoice.which) {
      case 0: // declaration
        final String accept = nodeChoice.choice.accept(this, argu);


        if (accept != null)

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice

  }


  @Override
  public String visit(final VarDecl n, final SymbolTable argu) {
    if (n.f3.present()) {
      final NodeChoice nodeChoice = (NodeChoice) n.f3.node;


      switch (nodeChoice.which) {
      case 0: // initializer
        argu.setId("___" + n.f0.f0.tokenImage);
        final String accept = ((NodeSequence) nodeChoice.choice).elementAt(1).accept(this, argu);

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice

  }


  @Override
  public String visit(final Composite n, final SymbolTable argu) {
    if (n.f1.present()) {
      final NodeChoice nodeChoice = (NodeChoice) n.f1.node;


      switch (nodeChoice.which) {
      case 0: // pair list
        return this.codegenerator.visit((PairList) nodeChoice.choice, argu);
      case 1: // expression list

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice

  @Override
  public String visit(final Program n, final SymbolTable argu) {
    final StringBuilder sb = new StringBuilder();


    for (final Node node : n.f0.nodes) {
      final NodeChoice nodeChoice = (NodeChoice) node;
      switch (nodeChoice.which) {
      case 0: // declaration
        final String accept = nodeChoice.choice.accept(this, argu);


        if (accept != null)

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice

    if (argu.contains(id))
      throw new TypeException("variable " + id + " already declared as " + argu.get(id));


    SizzleType rhs = null;
    if (n.f3.present()) {
      final NodeChoice nodeChoice = (NodeChoice) n.f3.node;
      switch (nodeChoice.which) {
      case 0: // initializer
        rhs = ((NodeSequence) nodeChoice.choice).elementAt(1).accept(this, argu);
        break;
      default:

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice

  /** {@inheritDoc} */
  @Override
  public SizzleType visit(final Factor n, final SymbolTable argu) {
    if (n.f1.present()) {
      for (final Node node : n.f1.nodes) {
        final NodeChoice nodeChoice = (NodeChoice) node;
        switch (nodeChoice.which) {
        case 0: // member
          final SizzleType soperand = n.f0.accept(this, argu);


          if (!(soperand instanceof SizzleTuple))

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice


  /** {@inheritDoc} */
  @Override
  public SizzleType visit(final Composite n, final SymbolTable argu) {
    if (n.f1.present()) {
      final NodeChoice nodeChoice = (NodeChoice) n.f1.node;


      switch (nodeChoice.which) {
      case 0: // pair list
      case 1: // expression list
        return nodeChoice.choice.accept(this, argu);

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice


    // TODO: make templates for types
    st.setAttribute("type", type.toJavaType());


    if (n.f3.present()) {
      final NodeChoice nodeChoice = (NodeChoice) n.f3.node;


      switch (nodeChoice.which) {
      case 0: // initializer
        SizzleType t;
        try {

View Full Code Here

Examples of sizzle.parser.syntaxtree.NodeChoice

    final StringTemplate st = this.stg.getInstanceOf("ExprStatement");


    st.setAttribute("expression", n.f0.accept(this, argu));


    if (n.f1.present()) {
      final NodeChoice nodeChoice = (NodeChoice) n.f1.node;
      switch (nodeChoice.which) {
      case 0:
        st.setAttribute("operator", "++");
        break;
      case 1:

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.