Package sizzle.parser.syntaxtree

Examples of sizzle.parser.syntaxtree.NodeChoice

85
86
87
88
89
90
91
92
93
94
95
  @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
131
132
133
134
135
136
137
138
139
140
141
  }

  @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
375
376
377
378
379
380
381
382
383
384
385
  }

  @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
93
94
95
96
97
98
99
100
101
102
103
  @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
154
155
156
157
158
159
160
161
162
163
164
    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
675
676
677
678
679
680
681
682
683
684
685
  /** {@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
795
796
797
798
799
800
801
802
803
804
805
  /** {@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
258
259
260
261
262
263
264
265
266
267
268
    // 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
472
473
474
475
476
477
478
479
480
481
482
    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
626
627
628
629
630
631
632
633
634
635
636
    if (n.f1.present()) {
      final List<String> operators = new ArrayList<String>();
      final List<String> operands = new ArrayList<String>();

      final Vector<Node> nodes = ((NodeSequence) n.f1.node).nodes;
      final NodeChoice nodeChoice = (NodeChoice) nodes.elementAt(0);
      switch (nodeChoice.which) {
      case 0:
        operators.add(" == ");
        break;
      case 1:
View Full Code Here
TOP

Related Classes of sizzle.parser.syntaxtree.NodeChoice

  • sizzle.compiler.CodeGeneratingVisitor
  • sizzle.compiler.StaticDeclarationCodeGeneratingVisitor
  • sizzle.compiler.StaticInitializationCodeGeneratingVisitor
  • sizzle.compiler.TypeCheckingVisitor
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.