/* Copyright or (C) or Copr. GET / ENST, Telecom-Paris, Ludovic Apvrille
 * 
 * ludovic.apvrille AT enst.fr
 * 
 * This software is a computer program whose purpose is to allow the
 * edition of TURTLE analysis, design and deployment diagrams, to
 * allow the generation of RT-LOTOS or Java code from this diagram,
 * and at last to allow the analysis of formal validation traces
 * obtained from external tools, e.g. RTL from LAAS-CNRS and CADP
 * from INRIA Rhone-Alpes.
 * 
 * This software is governed by the CeCILL  license under French law and
 * abiding by the rules of distribution of free software.  You can  use,
 * modify and/ or redistribute the software under the terms of the CeCILL
 * license as circulated by CEA, CNRS and INRIA at the following URL
 * "http://www.cecill.info".
 * 
 * As a counterpart to the access to the source code and  rights to copy,
 * modify and redistribute granted by the license, users are provided only
 * with a limited warranty  and the software's author,  the holder of the
 * economic rights,  and the successive licensors  have only  limited
 * liability.
 * 
 * In this respect, the user's attention is drawn to the risks associated
 * with loading,  using,  modifying and/or developing or reproducing the
 * software by the user in light of its specific status of free software,
 * that may mean  that it is complicated to manipulate,  and  that  also
 * therefore means  that it is reserved for developers  and  experienced
 * professionals having in-depth computer knowledge. Users are therefore
 * encouraged to load and test the software's suitability as regards their
 * requirements in conditions enabling the security of their systems and/or
 * data to be ensured and,  more generally, to use and operate it in the
 * same conditions as regards security.
 * 
 * The fact that you are presently reading this means that you have had
 * knowledge of the CeCILL license and that you accept its terms.
 */







package translator;



/**
 * Class TIFTreeNode
 * Creation: 20/02/2008
 * @version 1.0 20/02/2008
 * @author Ludovic APVRILLE
 */
public class TIFTreeNode  {
    
	public final static int Variable = 0;
	public final static int NUMERAL = 1;
	
	public final static int PLUS = 12;
	public final static int MINUS = 13;
	public final static int EQUAL = 13;
	
	public final static int MIN = 20;
	public final static int MAX = 21;
	public final static int EQUALEQUAL = 22;
	public final static int gt = 23;
	public final static int lt = 24;
	
	
	public final static int OPEN_P = 30;
	public final static int CLOSE_P = 31;
	public final static int OPEN_B = 32;   
	public final static int CLOSE_B = 33;
	
	
    private TIFTreeNode son1, son2;
	private int type;
	private String value;
    
    public TIFTreeNode(int _type) {
		type = _type;
    }
	
	public void setValue(String _value) {
		value = _value;
	}
	
	public String getValue() {
		return value;
	}
	
	public void setSon1(TIFTreeNode son) {
		son1 = son;
	}
	
	public void setSon2(TIFTreeNode son) {
		son2 = son;
	}
	
	public boolean isLeaf() {
		return ((son1 == null) && (son2 == null));
	}
    
   
}