00001 package edu.ksu.cis.bandera.spin; 00002 00003 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 00004 * Bandera, a Java(TM) analysis and transformation toolkit * 00005 * Copyright (C) 1998, 1999 James Corbett (corbett@hawaii.edu) * 00006 * All rights reserved. * 00007 * * 00008 * This work was done as a project in the SAnToS Laboratory, * 00009 * Department of Computing and Information Sciences, Kansas State * 00010 * University, USA (http://www.cis.ksu.edu/santos). * 00011 * It is understood that any modification not identified as such is * 00012 * not covered by the preceding statement. * 00013 * * 00014 * This work is free software; you can redistribute it and/or * 00015 * modify it under the terms of the GNU Library General Public * 00016 * License as published by the Free Software Foundation; either * 00017 * version 2 of the License, or (at your option) any later version. * 00018 * * 00019 * This work is distributed in the hope that it will be useful, * 00020 * but WITHOUT ANY WARRANTY; without even the implied warranty of * 00021 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * 00022 * Library General Public License for more details. * 00023 * * 00024 * You should have received a copy of the GNU Library General Public * 00025 * License along with this toolkit; if not, write to the * 00026 * Free Software Foundation, Inc., 59 Temple Place - Suite 330, * 00027 * Boston, MA 02111-1307, USA. * 00028 * * 00029 * Java is a trademark of Sun Microsystems, Inc. * 00030 * * 00031 * To submit a bug report, send a comment, or get the latest news on * 00032 * this project and other SAnToS projects, please visit the web-site * 00033 * http://www.cis.ksu.edu/santos * 00034 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ 00035 import java.io.*; 00036 import java.util.*; 00037 00038 import edu.ksu.cis.bandera.bir.*; 00039 00040 /** 00041 * A base expression in a case tree. 00042 * <p> 00043 * Note: an ExprNode actually holds two expressions. The first is 00044 * the main expression (the node's value). The second is an auxiliary 00045 * expression that holds the value of an ExprNode that this node 00046 * has been composed with until the ExprNode is updated via the update() 00047 * method. 00048 */ 00049 00050 public class ExprNode implements TreeNode { 00051 00052 public String expr1; 00053 public String expr2; 00054 00055 public ExprNode(String expr) { 00056 this.expr1 = expr; 00057 } 00058 public ExprNode(String expr1, String expr2) { 00059 this.expr1 = expr1; 00060 this.expr2 = expr2; 00061 } 00062 /** 00063 * When composing two case trees, when we reach a leaf of the 00064 * first tree (i.e., this method), then return the second tree 00065 * specialized in the context of the first tree. 00066 */ 00067 00068 public TreeNode compose(TreeNode tree, Case context) { 00069 return tree.specialize(this, context); 00070 } 00071 public Vector getLeafCases(Vector leafCases) { 00072 return null; 00073 } 00074 public Vector getLeaves(Vector leaves) { 00075 leaves.addElement(this); 00076 return leaves; 00077 } 00078 public void print(int level) { 00079 if (expr2 == null) 00080 System.out.println(expr1); 00081 else 00082 System.out.println("(" + expr1 + "," + expr2 + ")"); 00083 } 00084 /** 00085 * When composing two case trees and we reach the bottom of 00086 * the second tree, make an ExprNode that holds the two 00087 * expressions from the original nodes. 00088 */ 00089 00090 public TreeNode specialize(ExprNode leaf, Case context) { 00091 return new ExprNode(leaf.expr1, this.expr1); 00092 } 00093 public void update(String expr) { 00094 this.expr1 = expr; 00095 this.expr2 = null; 00096 } 00097 }