View Javadoc

1   /*
2    * Copyright (C) 2006 uguu@users.sourceforge.jp, All Rights Reserved.
3    *
4    * Redistribution and use in source and binary forms, with or without
5    * modification, are permitted provided that the following conditions
6    * are met:
7    *
8    *    1. Redistributions of source code must retain the above copyright
9    *       notice, this list of conditions and the following disclaimer.
10   *
11   *    2. Redistributions in binary form must reproduce the above copyright
12   *       notice, this list of conditions and the following disclaimer in the
13   *       documentation and/or other materials provided with the distribution.
14   *
15   *    3. Neither the name of Clarkware Consulting, Inc. nor the names of its
16   *       contributors may be used to endorse or promote products derived
17   *       from this software without prior written permission. For written
18   *       permission, please contact clarkware@clarkware.com.
19   *
20   * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
21   * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
22   * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
23   * CLARKWARE CONSULTING OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
24   * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25   * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
26   * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
27   * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
28   * NEGLIGENCE OR OTHERWISE) ARISING IN  ANY WAY OUT OF THE USE OF THIS SOFTWARE,
29   * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30   */
31  
32  package jp.sourceforge.rpn_computer.node;
33  
34  import jp.sourceforge.rpn_computer.ParseException;
35  import jp.sourceforge.rpn_computer.RpnCompileContext;
36  import jp.sourceforge.rpn_computer.RpnNode;
37  import jp.sourceforge.rpn_computer.token.MinusToken;
38  import jp.sourceforge.rpn_computer.token.MinusTokenInfo;
39  import jp.sourceforge.rpn_computer.token.PlusToken;
40  import jp.sourceforge.rpn_computer.token.PlusTokenInfo;
41  import jp.sourceforge.rpn_computer.token.SkipTokenInfo;
42  import jp.sourceforge.tokenizer.Token;
43  import jp.sourceforge.tokenizer.TokenInfo;
44  import jp.sourceforge.tokenizer.Tokenizer;
45  
46  /**
47   * <p>
48   * AdditiveExpressionを表すノードです。
49   * </p>
50   * 
51   * @author uguu@users.sourceforge.jp
52   */
53  public final class AdditiveExpressionNode extends AbstractNode {
54  
55      /**
56       * {@inheritDoc}
57       */
58      public void parse(Tokenizer tokenizer) {
59          RpnNode node = new MultiplicativeExpressionNode();
60          node.parse(tokenizer);
61          this.addNode(node);
62  
63          TokenInfo[] readTokenInfos = new TokenInfo[] { new PlusTokenInfo(), new MinusTokenInfo(), };
64          TokenInfo[] skipTokenInfos = new TokenInfo[] { new SkipTokenInfo(), };
65          if (tokenizer.read(readTokenInfos, skipTokenInfos)) {
66              Token token = tokenizer.current();
67              if (token instanceof PlusToken) {
68                  node = new AddNode();
69              } else if (token instanceof MinusToken) {
70                  node = new SubtractNode();
71              } else {
72                  throw new ParseException(token, readTokenInfos);
73              }
74              node.parse(tokenizer);
75              this.addNode(node);
76  
77              node = new AdditiveExpressionNode();
78              node.parse(tokenizer);
79              this.addNode(node);
80          }
81      }
82  
83      /**
84       * {@inheritDoc}
85       */
86      public String toString() {
87          return "additive expression\n" + this.toChildrenString();
88      }
89  
90      /**
91       * {@inheritDoc}
92       */
93      public void compile(RpnCompileContext context) {
94          RpnNode[] nodes = this.getChildren();
95  
96          if (nodes.length == 1) {
97              nodes[0].compile(context);
98          } else {
99              nodes[0].compile(context);
100             nodes[2].compile(context);
101             nodes[1].compile(context);
102         }
103     }
104 }