Package org.jostraca.comp.antlr.collections

Examples of org.jostraca.comp.antlr.collections.AST

324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
        return getText();
    }

    /** Print out a child-sibling tree in LISP notation */
    public String toStringList() {
        AST t = this;
        String ts = "";
        if (t.getFirstChild() != null) ts += " (";
        ts += " " + this.toString();
        if (t.getFirstChild() != null) {
            ts += ((BaseAST)t.getFirstChild()).toStringList();
        }
        if (t.getFirstChild() != null) ts += " )";
        if (t.getNextSibling() != null) {
            ts += ((BaseAST)t.getNextSibling()).toStringList();
        }
        return ts;
    }
View Full Code Here
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
        }
        return ts;
    }

    public String toStringTree() {
        AST t = this;
        String ts = "";
        if (t.getFirstChild() != null) ts += " (";
        ts += " " + this.toString();
        if (t.getFirstChild() != null) {
            ts += ((BaseAST)t.getFirstChild()).toStringList();
        }
        if (t.getFirstChild() != null) ts += " )";
        return ts;
    }
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
    if ( step<=0 ) {
      buf.append(' ');
      buf.append(toString());
      return numReplacements;
    }
    AST child = getFirstChild();
    numReplacements = 1;
    // walk child printing them out, descending into at most one
    while ( child!=null ) {
      if ( numReplacements>=step || child instanceof ParseTreeToken ) {
        buf.append(' ');
        buf.append(child.toString());
      }
      else {
        // descend for at least one more derivation; update count
        int remainingReplacements = step-numReplacements;
        int n = ((ParseTree)child).getLeftmostDerivation(buf,
                                 remainingReplacements);
        numReplacements += n;
      }
      child = child.getNextSibling();
    }
    return numReplacements;
  }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
    }

    public void visit(AST node) {
        // Flatten this level of the tree if it has no children
        boolean flatten = /*true*/ false;
        AST node2;
        for (node2 = node; node2 != null; node2 = node2.getNextSibling()) {
            if (node2.getFirstChild() != null) {
                flatten = false;
                break;
            }
        }

        for (node2 = node; node2 != null; node2 = node2.getNextSibling()) {
            if (!flatten || node2 == node) {
                tabs();
            }
            if (node2.getText() == null) {
                System.out.print("nil");
            }
            else {
                System.out.print(node2.getText());
            }

            System.out.print(" [" + node2.getType() + "] ");

            if (flatten) {
                System.out.print(" ");
            }
            else {
                System.out.println("");
            }

            if (node2.getFirstChild() != null) {
                level++;
                visit(node2.getFirstChild());
                level--;
            }
        }

        if (flatten) {
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
}

  public final boolean  expr(AST _t) throws RecognitionException {
    boolean r;
   
    AST expr_AST_in = (_t == ASTNULL) ? null : (AST)_t;
   
      boolean a,b;
      r = false;
   
   
    try {      // for error handling
      if (_t==null) _t=ASTNULL;
      switch ( _t.getType()) {
      case XOR:
      {
        AST __t31 = _t;
        AST tmp1_AST_in = (AST)_t;
        match(_t,XOR);
        _t = _t.getFirstChild();
        a=expr(_t);
        _t = _retTree;
        b=expr(_t);
        _t = _retTree;
        _t = __t31;
        _t = _t.getNextSibling();
        r = !(a && b) && (a || b);
        break;
      }
      case OR:
      {
        AST __t32 = _t;
        AST tmp2_AST_in = (AST)_t;
        match(_t,OR);
        _t = _t.getFirstChild();
        a=expr(_t);
        _t = _retTree;
        b=expr(_t);
        _t = _retTree;
        _t = __t32;
        _t = _t.getNextSibling();
        r = a || b;
        break;
      }
      case AND:
      {
        AST __t33 = _t;
        AST tmp3_AST_in = (AST)_t;
        match(_t,AND);
        _t = _t.getFirstChild();
        a=expr(_t);
        _t = _retTree;
        b=expr(_t);
        _t = _retTree;
        _t = __t33;
        _t = _t.getNextSibling();
        r = a && b;
        break;
      }
      case NOT:
      {
        AST __t34 = _t;
        AST tmp4_AST_in = (AST)_t;
        match(_t,NOT);
        _t = _t.getFirstChild();
        a=expr(_t);
        _t = _retTree;
        _t = __t34;
        _t = _t.getNextSibling();
        r = !a;
        break;
      }
      case TRUE:
      {
        AST tmp5_AST_in = (AST)_t;
        match(_t,TRUE);
        _t = _t.getNextSibling();
        r = true;
        break;
      }
      case FALSE:
      {
        AST tmp6_AST_in = (AST)_t;
        match(_t,FALSE);
        _t = _t.getNextSibling();
        r = false;
        break;
      }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
  public final void expr() throws RecognitionException, TokenStreamException {
   
    returnAST = null;
    ASTPair currentAST = new ASTPair();
    AST expr_AST = null;
   
    try {      // for error handling
      xorexpr();
      astFactory.addASTChild(currentAST, returnAST);
      expr_AST = (AST)currentAST.root;
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
 
  public final void xorexpr() throws RecognitionException, TokenStreamException {
   
    returnAST = null;
    ASTPair currentAST = new ASTPair();
    AST xorexpr_AST = null;
   
    try {      // for error handling
      orexpr();
      astFactory.addASTChild(currentAST, returnAST);
      {
      _loop21:
      do {
        if ((LA(1)==XOR)) {
          AST tmp7_AST = null;
          tmp7_AST = astFactory.create(LT(1));
          astFactory.makeASTRoot(currentAST, tmp7_AST);
          match(XOR);
          orexpr();
          astFactory.addASTChild(currentAST, returnAST);
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
 
  public final void orexpr() throws RecognitionException, TokenStreamException {
   
    returnAST = null;
    ASTPair currentAST = new ASTPair();
    AST orexpr_AST = null;
   
    try {      // for error handling
      andexpr();
      astFactory.addASTChild(currentAST, returnAST);
      {
      _loop24:
      do {
        if ((LA(1)==OR)) {
          AST tmp8_AST = null;
          tmp8_AST = astFactory.create(LT(1));
          astFactory.makeASTRoot(currentAST, tmp8_AST);
          match(OR);
          andexpr();
          astFactory.addASTChild(currentAST, returnAST);
View Full Code Here
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
 
  public final void andexpr() throws RecognitionException, TokenStreamException {
   
    returnAST = null;
    ASTPair currentAST = new ASTPair();
    AST andexpr_AST = null;
   
    try {      // for error handling
      nexpr();
      astFactory.addASTChild(currentAST, returnAST);
      {
      _loop27:
      do {
        if ((LA(1)==AND)) {
          AST tmp9_AST = null;
          tmp9_AST = astFactory.create(LT(1));
          astFactory.makeASTRoot(currentAST, tmp9_AST);
          match(AND);
          nexpr();
          astFactory.addASTChild(currentAST, returnAST);
View Full Code Here
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
 
  public final void nexpr() throws RecognitionException, TokenStreamException {
   
    returnAST = null;
    ASTPair currentAST = new ASTPair();
    AST nexpr_AST = null;
   
    try {      // for error handling
      switch ( LA(1)) {
      case NOT:
      {
        AST tmp10_AST = null;
        tmp10_AST = astFactory.create(LT(1));
        astFactory.makeASTRoot(currentAST, tmp10_AST);
        match(NOT);
        pexpr();
        astFactory.addASTChild(currentAST, returnAST);
View Full Code Here
TOP

Related Classes of org.jostraca.comp.antlr.collections.AST

  • org.jostraca.comp.antlr.ASTFactory
  • org.jostraca.comp.antlr.ASTIterator
  • org.jostraca.comp.antlr.BaseAST
  • org.jostraca.comp.antlr.DumpASTVisitor
  • org.jostraca.comp.antlr.ParseTreeRule
  • org.jostraca.util.BooleanAntlrParser
  • org.jostraca.util.BooleanAntlrTree
    • 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.