Package info.bliki.wiki.template.expr.operator

Examples of info.bliki.wiki.template.expr.operator.InfixOperator

117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
  }

  private ASTNode parseLookaheadOperator(final int min_precedence) {
    ASTNode rhs = parsePrimary();
    Operator operLookahead;
    InfixOperator binOper;
    while (true) {
      final int lookahead = fToken;
      if (lookahead != TT_OPERATOR) {
        break;
      }
      operLookahead = determineBinaryOperator();
      if (operLookahead instanceof InfixOperator) {
        binOper = (InfixOperator) operLookahead;
        if (binOper.getPrecedence() > min_precedence) {
          rhs = parseOperators(rhs, operLookahead.getPrecedence());
          continue;
        } else if ((binOper.getPrecedence() == min_precedence) && (binOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE)) {
          rhs = parseOperators(rhs, operLookahead.getPrecedence());
          continue;
        }
      } else {
        operLookahead = determinePostfixOperator();
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
  }

  private ASTNode parseLookaheadOperator(final int min_precedence) {
    ASTNode rhs = parsePrimary();
    Operator operLookahead;
    InfixOperator binOper;
    while (true) {
      final int lookahead = fToken;
      if (lookahead != TT_OPERATOR) {
        break;
      }
      operLookahead = determineBinaryOperator();
      if (operLookahead instanceof InfixOperator) {
        binOper = (InfixOperator) operLookahead;
        if (binOper.getPrecedence() > min_precedence) {
          rhs = parseOperators(rhs, operLookahead.getPrecedence());
          continue;
        } else if ((binOper.getPrecedence() == min_precedence) && (binOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE)) {
          rhs = parseOperators(rhs, operLookahead.getPrecedence());
          continue;
        }
      } else {
        operLookahead = determinePostfixOperator();
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
  }

  private ASTNode parseLookaheadOperator(final int min_precedence) {
    ASTNode rhs = parsePrimary();
    Operator operLookahead;
    InfixOperator binOper;
    while (true) {
      final int lookahead = fToken;
      if (lookahead != TT_OPERATOR) {
        break;
      }
      operLookahead = determineBinaryOperator();
      if (operLookahead instanceof InfixOperator) {
        binOper = (InfixOperator) operLookahead;
        if (binOper.getPrecedence() > min_precedence) {
          rhs = parseOperators(rhs, operLookahead.getPrecedence());
          continue;
        } else if ((binOper.getPrecedence() == min_precedence) && (binOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE)) {
          rhs = parseOperators(rhs, operLookahead.getPrecedence());
          continue;
        }
      } else {
        operLookahead = determinePostfixOperator();
View Full Code Here
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
      System.out.println("public static final Operator[] OPERATORS = {");
      while (i3.hasNext()) {
        final String headStr = i3.next();
        final Operator oper = operatorMap.get(headStr);
        if (oper instanceof DivideOperator) {
          final InfixOperator iOper = (DivideOperator) oper;
          String grouping = null;
          if (iOper.getGrouping() == InfixOperator.NONE) {
            grouping = "InfixOperator.NONE";
          } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
            grouping = "InfixOperator.LEFT_ASSOCIATIVE";
          } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
            grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
          }
          System.out.println("    new DivideOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", "
              + iOper.getPrecedence() + ", " + grouping + "),");
        } else if (oper instanceof SubtractOperator) {
          final InfixOperator iOper = (SubtractOperator) oper;
          String grouping = null;
          if (iOper.getGrouping() == InfixOperator.NONE) {
            grouping = "InfixOperator.NONE";
          } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
            grouping = "InfixOperator.LEFT_ASSOCIATIVE";
          } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
            grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
          }
          System.out.println("    new SubtractOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName()
              + "\", " + iOper.getPrecedence() + ", " + grouping + "),");
        } else if (oper instanceof InfixOperator) {
          final InfixOperator iOper = (InfixOperator) oper;
          String grouping = null;
          if (iOper.getGrouping() == InfixOperator.NONE) {
            grouping = "InfixOperator.NONE";
          } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
            grouping = "InfixOperator.LEFT_ASSOCIATIVE";
          } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
            grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
          }
          System.out.println("    new InfixOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", "
              + iOper.getPrecedence() + ", " + grouping + "),");
        } else if (oper instanceof PostfixOperator) {
          System.out.println("    new PostfixOperator(\"" + oper.getOperatorString() + "\", \"" + oper.getFunctionName() + "\", "
              + oper.getPrecedence() + "),");
        } else if (oper instanceof PreMinusOperator) {
          System.out.println("    new PreMinusOperator(\"" + oper.getOperatorString() + "\", \"" + oper.getFunctionName() + "\", "
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
            } else if (groupingStr.equalsIgnoreCase("right")) {
              grouping = InfixOperator.RIGHT_ASSOCIATIVE;
            }
            oper = ASTNodeFactory.createInfixOperator(operatorStr, headStr, precedence, grouping);
          } catch (final NoSuchElementException nsee) {
            oper = new InfixOperator(operatorStr, headStr, precedence, InfixOperator.NONE);
          }
          // if (operatorStr.equals("*")) {
          // TIMES_OPERATOR = (InfixOperator) oper;
          // } else if (operatorStr.equals("+")) {
          // PLUS_OPERATOR = (InfixOperator) oper;
View Full Code Here
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
            System.out.println("public static final Operator[] OPERATORS = {");
            while (i3.hasNext()) {
                final String headStr = i3.next();
                final Operator oper = operatorMap.get(headStr);
                if (oper instanceof DivideOperator) {
                    final InfixOperator iOper = (DivideOperator) oper;
                    String grouping = null;
                    if (iOper.getGrouping() == InfixOperator.NONE) {
                        grouping = "InfixOperator.NONE";
                    } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
                        grouping = "InfixOperator.LEFT_ASSOCIATIVE";
                    } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
                        grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
                    }
                    System.out.println("    new DivideOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", "
                            + iOper.getPrecedence() + ", " + grouping + "),");
                } else if (oper instanceof SubtractOperator) {
                    final InfixOperator iOper = (SubtractOperator) oper;
                    String grouping = null;
                    if (iOper.getGrouping() == InfixOperator.NONE) {
                        grouping = "InfixOperator.NONE";
                    } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
                        grouping = "InfixOperator.LEFT_ASSOCIATIVE";
                    } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
                        grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
                    }
                    System.out.println("    new SubtractOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName()
                            + "\", " + iOper.getPrecedence() + ", " + grouping + "),");
                } else if (oper instanceof InfixOperator) {
                    final InfixOperator iOper = (InfixOperator) oper;
                    String grouping = null;
                    if (iOper.getGrouping() == InfixOperator.NONE) {
                        grouping = "InfixOperator.NONE";
                    } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
                        grouping = "InfixOperator.LEFT_ASSOCIATIVE";
                    } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
                        grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
                    }
                    System.out.println("    new InfixOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", "
                            + iOper.getPrecedence() + ", " + grouping + "),");
                } else if (oper instanceof PostfixOperator) {
                    System.out.println("    new PostfixOperator(\"" + oper.getOperatorString() + "\", \"" + oper.getFunctionName() + "\", "
                            + oper.getPrecedence() + "),");
                } else if (oper instanceof PreMinusOperator) {
                    System.out.println("    new PreMinusOperator(\"" + oper.getOperatorString() + "\", \"" + oper.getFunctionName() + "\", "
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
    }

    private ASTNode parseLookaheadOperator(final int min_precedence) {
        ASTNode rhs = parsePrimary();
        Operator operLookahead;
        InfixOperator binOper;
        while (true) {
            final int lookahead = fToken;
            if (lookahead != TT_OPERATOR) {
                break;
            }
            operLookahead = determineBinaryOperator();
            if (operLookahead instanceof InfixOperator) {
                binOper = (InfixOperator) operLookahead;
                if (binOper.getPrecedence() > min_precedence) {
                    rhs = parseOperators(rhs, operLookahead.getPrecedence());
                    continue;
                } else if ((binOper.getPrecedence() == min_precedence) && (binOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE)) {
                    rhs = parseOperators(rhs, operLookahead.getPrecedence());
                    continue;
                }
            } else {
                operLookahead = determinePostfixOperator();
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
                        } else if (groupingStr.equalsIgnoreCase("right")) {
                            grouping = InfixOperator.RIGHT_ASSOCIATIVE;
                        }
                        oper = ASTNodeFactory.createInfixOperator(operatorStr, headStr, precedence, grouping);
                    } catch (final NoSuchElementException nsee) {
                        oper = new InfixOperator(operatorStr, headStr, precedence, InfixOperator.NONE);
                    }
                    // if (operatorStr.equals("*")) {
                    // TIMES_OPERATOR = (InfixOperator) oper;
                    // } else if (operatorStr.equals("+")) {
                    // PLUS_OPERATOR = (InfixOperator) oper;
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
  }

  private ASTNode parseLookaheadOperator(final int min_precedence) {
    ASTNode rhs = parsePrimary();
    Operator operLookahead;
    InfixOperator binOper;
    while (true) {
      final int lookahead = fToken;
      if (lookahead != TT_OPERATOR) {
        break;
      }
      operLookahead = determineBinaryOperator();
      if (operLookahead instanceof InfixOperator) {
        binOper = (InfixOperator) operLookahead;
        if (binOper.getPrecedence() > min_precedence) {
          rhs = parseOperators(rhs, operLookahead.getPrecedence());
          continue;
        } else if ((binOper.getPrecedence() == min_precedence) && (binOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE)) {
          rhs = parseOperators(rhs, operLookahead.getPrecedence());
          continue;
        }
      } else {
        operLookahead = determinePostfixOperator();
View Full Code Here
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
110
111
112
113
114
115
116
117
118
119
120
121
122
      System.out.println("public static final Operator[] OPERATORS = {");
      while (i3.hasNext()) {
        final String headStr = (String) i3.next();
        final Operator oper = (Operator) operatorMap.get(headStr);
        if (oper instanceof DivideOperator) {
          final InfixOperator iOper = (DivideOperator) oper;
          String grouping = null;
          if (iOper.getGrouping() == InfixOperator.NONE) {
            grouping = "InfixOperator.NONE";
          } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
            grouping = "InfixOperator.LEFT_ASSOCIATIVE";
          } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
            grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
          }
          System.out.println("    new DivideOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", "
              + iOper.getPrecedence() + ", " + grouping + "),");
        } else if (oper instanceof SubtractOperator) {
          final InfixOperator iOper = (SubtractOperator) oper;
          String grouping = null;
          if (iOper.getGrouping() == InfixOperator.NONE) {
            grouping = "InfixOperator.NONE";
          } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
            grouping = "InfixOperator.LEFT_ASSOCIATIVE";
          } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
            grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
          }
          System.out.println("    new SubtractOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName()
              + "\", " + iOper.getPrecedence() + ", " + grouping + "),");
        } else if (oper instanceof InfixOperator) {
          final InfixOperator iOper = (InfixOperator) oper;
          String grouping = null;
          if (iOper.getGrouping() == InfixOperator.NONE) {
            grouping = "InfixOperator.NONE";
          } else if (iOper.getGrouping() == InfixOperator.LEFT_ASSOCIATIVE) {
            grouping = "InfixOperator.LEFT_ASSOCIATIVE";
          } else if (iOper.getGrouping() == InfixOperator.RIGHT_ASSOCIATIVE) {
            grouping = "InfixOperator.RIGHT_ASSOCIATIVE";
          }
          System.out.println("    new InfixOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", "
              + iOper.getPrecedence() + ", " + grouping + "),");
        } else if (oper instanceof PostfixOperator) {
          System.out.println("    new PostfixOperator(\"" + oper.getOperatorString() + "\", \"" + oper.getFunctionName() + "\", "
              + oper.getPrecedence() + "),");
        } else if (oper instanceof PreMinusOperator) {
          System.out.println("    new PreMinusOperator(\"" + oper.getOperatorString() + "\", \"" + oper.getFunctionName() + "\", "
View Full Code Here
TOP

Related Classes of info.bliki.wiki.template.expr.operator.InfixOperator

  • info.bliki.wiki.template.expr.Parser
  • info.bliki.wiki.template.expr.util.GenerateOperatorArrays
    • 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.