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

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

50
51
52
53
54
55
56
57
58
59
60
     * Determine the current PrefixOperator
     *
     * @return <code>null</code> if no prefix operator could be determined
     */
    private PrefixOperator determinePrefixOperator() {
        Operator oper = null;
        for (int i = 0; i < fOperList.size(); i++) {
            oper = (Operator) fOperList.get(i);
            if (oper instanceof PrefixOperator) {
                return (PrefixOperator) oper;
            }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
     * Determine the current PostfixOperator
     *
     * @return <code>null</code> if no postfix operator could be determined
     */
    private PostfixOperator determinePostfixOperator() {
        Operator oper = null;
        for (int i = 0; i < fOperList.size(); i++) {
            oper = (Operator) fOperList.get(i);
            if (oper instanceof PostfixOperator) {
                return (PostfixOperator) oper;
            }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
     * Determine the current BinaryOperator
     *
     * @return <code>null</code> if no binary operator could be determined
     */
    private InfixOperator determineBinaryOperator() {
        Operator oper = null;
        for (int i = 0; i < fOperList.size(); i++) {
            oper = (Operator) fOperList.get(i);
            if (oper instanceof InfixOperator) {
                return (InfixOperator) oper;
            }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
        return null;
    }

    private ASTNode parsePrimary() {
        if (fToken == TT_OPERATOR) {
            final Operator oper = determinePrefixOperator();

            if (oper instanceof PrefixOperator) {
                getNextToken();
                final ASTNode temp = parseLookaheadOperator(oper.getPrecedence());
                if (oper.getFunctionName().equals("PreMinus")) {
                    // special cases for negative numbers
                    if (temp instanceof NumberNode) {
                        ((NumberNode) temp).toggleSign();
                        return temp;
                    }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
        return getFactor();
    }

    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();

                if (operLookahead instanceof PostfixOperator) {
                    if (operLookahead.getPrecedence() > min_precedence) {
                        getNextToken();
                        rhs = ((PostfixOperator) operLookahead).createFunction(fFactory, rhs);
                        continue;
                    }
                }
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
     * @param min_precedence
     * @return
     */
    private ASTNode parseOperators(ASTNode lhs, final int min_precedence) {
        ASTNode rhs = null;
        Operator oper;
        while (true) {
            if (fToken != TT_OPERATOR) {
                break;
            }
            oper = determineBinaryOperator();

            if (oper instanceof InfixOperator) {
                if (oper.getPrecedence() >= min_precedence) {
                    getNextToken();
                    rhs = parseLookaheadOperator(oper.getPrecedence());
                    lhs = ((InfixOperator) oper).createFunction(fFactory, lhs, rhs);
                    continue;
                }
            } else {
                oper = determinePostfixOperator();
View Full Code Here
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
            final Iterator<String> i2 = operatorMap.keySet().iterator();
            System.out.println("public static final String[] OPERATOR_STRINGS = {");
            while (i2.hasNext()) {
                final String headStr = i2.next();
                final Operator oper = operatorMap.get(headStr);
                if (oper == null) {
                    System.out.println("    \" null-value-in-operator-map \",");
                } else {
                    System.out.println("    \"" + oper.getOperatorString() + "\",");
                }
            }
            System.out.println("};");

            final Iterator<String> i3 = operatorMap.keySet().iterator();
            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() + "\", "
                            + oper.getPrecedence() + "),");
                } else if (oper instanceof PrePlusOperator) {
                    System.out.println("    new PrePlusOperator(\"" + oper.getOperatorString() + "\", \"" + oper.getFunctionName() + "\", "
                            + oper.getPrecedence() + "),");
                } else if (oper instanceof PrefixOperator) {
                    System.out.println("    new PrefixOperator(\"" + oper.getOperatorString() + "\", \"" + oper.getFunctionName() + "\", "
                            + oper.getPrecedence() + "),");
                }

            }
            System.out.println("};");
        } catch (FileNotFoundException e) {
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
    public static void generateOperatorTable(final InputStream is, final HashMap<String, Operator> operatorMap, final HashMap<String, ArrayList<Operator>> operatorTokenStartSet) {
        String record = null;
        final BufferedReader r = new BufferedReader(new InputStreamReader(is));

        StringTokenizer tokenizer;
        Operator oper = null;
        String typeStr;
        String operatorStr;
        String headStr;
        String precedenceStr;
        String groupingStr;
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
   * Determine the current PrefixOperator
   *
   * @return <code>null</code> if no prefix operator could be determined
   */
  private PrefixOperator determinePrefixOperator() {
    Operator oper = null;
    for (int i = 0; i < fOperList.size(); i++) {
      oper = (Operator) fOperList.get(i);
      if (oper instanceof PrefixOperator) {
        return (PrefixOperator) oper;
      }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
   * Determine the current PostfixOperator
   *
   * @return <code>null</code> if no postfix operator could be determined
   */
  private PostfixOperator determinePostfixOperator() {
    Operator oper = null;
    for (int i = 0; i < fOperList.size(); i++) {
      oper = (Operator) fOperList.get(i);
      if (oper instanceof PostfixOperator) {
        return (PostfixOperator) oper;
      }
View Full Code Here
TOP

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

  • 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.