Package info.bliki.wiki.template.expr.ast

Examples of info.bliki.wiki.template.expr.ast.ASTNode

244
245
246
247
248
249
250
251
252
253
254
    getNextToken();
    return temp;
  }

  private ASTNode getFactor() throws SyntaxError {
    ASTNode temp;

    if (fToken == TT_CONSTANT) {
      temp = fFactory.createSymbol(fOperatorString);
      getNextToken();
      return temp;
View Full Code Here
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
   *
   */
  public ASTNode optimizeFunction(final FunctionNode functionNode) {
    if (functionNode.size() > 0) {
      boolean doubleOnly = true;
      ASTNode node;
      for (int i = 1; i < functionNode.size(); i++) {
        node = functionNode.get(i);
        if (node instanceof NumberNode) {
          functionNode.set(i, new DoubleNode(((NumberNode) functionNode.get(i)).doubleValue()));
        } else if (functionNode.get(i) instanceof FunctionNode) {
          ASTNode optNode = optimizeFunction((FunctionNode) functionNode.get(i));
          if (!(optNode instanceof DoubleNode)) {
            doubleOnly = false;
          }
          functionNode.set(i, optNode);
        } else {
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
        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
115
116
117
118
119
120
121
122
123
124
125
        }
        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) {
View Full Code Here
161
162
163
164
165
166
167
168
169
170
171
     *          the already parsed left-hand-side of the operator
     * @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;
            }
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
     * @return the parsed ASTNode representation of the given formula string
     * @throws SyntaxError
     */
    public ASTNode parse(final String expression) throws SyntaxError {
        initialize(expression);
        final ASTNode temp = parseOperators(parsePrimary(), 0);
        if (fToken != TT_EOF) {
            if (fToken == TT_PRECEDENCE_CLOSE) {
                throwSyntaxError("Too many closing ')'; End-of-file not reached.");
            }

View Full Code Here
223
224
225
226
227
228
229
230
231
232
233
     *
     * @return
     * @see
     */
    private ASTNode getNumber(final boolean negative) throws SyntaxError {
        ASTNode temp = null;
        final Object[] result = getNumberString();
        String number = (String) result[0];
        final int numFormat = ((Integer) result[1]).intValue();
        try {
            if (negative) {
View Full Code Here
244
245
246
247
248
249
250
251
252
253
254
        getNextToken();
        return temp;
    }

    private ASTNode getFactor() throws SyntaxError {
        ASTNode temp;

        if (fToken == TT_CONSTANT) {
            temp = fFactory.createSymbol(fOperatorString);
            getNextToken();
            return temp;
View Full Code Here
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
     *
     */
    public ASTNode optimizeFunction(final FunctionNode functionNode) {
        if (functionNode.size() > 0) {
            boolean doubleOnly = true;
            ASTNode node;
            for (int i = 1; i < functionNode.size(); i++) {
                node = functionNode.get(i);
                if (node instanceof NumberNode) {
                    functionNode.set(i, new DoubleNode(((NumberNode) functionNode.get(i)).doubleValue()));
                } else if (functionNode.get(i) instanceof FunctionNode) {
                    ASTNode optNode = optimizeFunction((FunctionNode) functionNode.get(i));
                    if (!(optNode instanceof DoubleNode)) {
                        doubleOnly = false;
                    }
                    functionNode.set(i, optNode);
                } else {
View Full Code Here
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
   *
   */
  public ASTNode optimizeFunction(final FunctionNode functionNode) {
    if (functionNode.size() > 0) {
      boolean doubleOnly = true;
      ASTNode node;
      for (int i = 1; i < functionNode.size(); i++) {
        node = functionNode.get(i);
        if (node instanceof NumberNode) {
          functionNode.set(i, new DoubleNode(((NumberNode) functionNode.get(i)).doubleValue()));
        } else if (functionNode.get(i) instanceof FunctionNode) {
          ASTNode optNode = optimizeFunction((FunctionNode) functionNode.get(i));
          if (!(optNode instanceof DoubleNode)) {
            doubleOnly = false;
          }
          functionNode.set(i, optNode);
        } else {
View Full Code Here
TOP

Related Classes of info.bliki.wiki.template.expr.ast.ASTNode

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