WARNING: Compilation error, verify your source file

"; die("Please click 'back' on your browser."); } } function show_methods($list,$context,$file_name) { $acm=substr_count($list,'main([Ljava/lang/String;)V'); $acm_cmd=substr_count($list,'commandAction(Ljavax/microedition/lcdui/Command;Ljavax/microedition/lcdui/Displayable;)V'); if(substr_count($list,',')>0) { $method_signature=explode(',',$list); }else { $method_signature=explode(" ",$list); } $limit=count($method_signature); if ($limit>1) { $limit=$limit-1; } if ($acm == 1 || $acm_cmd == 1) { // there is a main or cmdAction for($i=0; $i < $limit; $i ++) { // bubble if(substr_count($method_signature[$i],'main([Ljava/lang/String;)V')==1 || substr_count($method_signature[$i],'commandAction(Ljavax/microedition/lcdui/Command;Ljavax/microedition/lcdui/Displayable;)V')==1) { $aux=$method_signature[0]; $method_signature[0]=$method_signature[$i]; $method_signature[$i]=$aux; } } if (substr_count($file_name,'x10') != 1){ ?> or Select All "; } echo "
"; for($i=0; $i < $limit; $i ++) { $method_sign=htmlentities($method_signature[$i]); if($i==0) { //if(substr_count($method_sign,'main([Ljava/lang/String;)V')==1 || substr_count($method_sign,'commandAction(Ljavax/microedition/lcdui/Command;Ljavax/microedition/lcdui/Displayable;)V')==1){ //echo " $method_signature[$i]"."
"; echo " $method_signature[$i]"."
"; } else { echo " $method_signature[$i] "."
"; } } if($context!="") { $size=strlen($context); echo "
Context Info (Classes)
"; } // else { // echo "
Context Info (Classes)
"; // } }else { // not main if (substr_count($file_name,'x10') != 1){ ?> or Select All "; } echo "
"; for($i=0; $i < $limit; $i ++) { $method_sign=htmlentities($method_signature[$i]); if($i==0) { // echo " $method_signature[$i] "."
"; echo " $method_signature[$i] "."
"; }else { // echo " $method_signature[$i] "."
"; echo " $method_signature[$i]"."
"; } } if($context!="") { $size=strlen($context); echo "
Context Info (Classes)
"; } // else { // echo "
Context Info (Classes)
"; // } } } //function parse_dot_seetings($examples,$filename){ function parse_dot_seetings($path,$filename) { $define_settings=array('-m','-c','cost_model','-u','compute_asymptotic_ub','gc_model','-p'); $flags=array(); $values_settings=array(); //$path_to_settings_file=$examples."/".$filename.".settings"; $path_to_settings_file=$path."/".$filename.".settings"; if (file_exists($path_to_settings_file)) { $values=file_get_contents($path_to_settings_file); $settings=explode(PHP_EOL,chop($values)); for($i=0;$i',$file_contents);// for($j=0; $j until //for ($i=0; $i=1){ /// looking if the flag exsits in option
  • if(substr_count($each_option_web[$j],$flags[$i])>=1) { /// looking if the flag exsits in option
  • $eachline_opt=explode(' $restline[0]=array_pop($new_value); ///
    } $tmp[0]= implode(" ",$new_value); array_splice($eachline_opt, 1,1, $tmp); $tmp[1]=implode(" ",$old_default); array_splice($eachline_opt, $pos,1, $tmp); array_splice($eachline_opt, $pos,1); } //if($i<=count($values_flags)){$each_option_web[$j]=implode('", $each_option_web); $remove1=str_replace('
  • ', '', $implode); $remove2=str_replace('', '', $remove2); $remove4=str_replace('
  • ', '', $remove3); $remove5=str_replace('', '', $remove4); $remove6=str_replace(' > ',' > ',$remove5); echo $remove6; echo ""; } ?> COSt Termination Analyzer for Java Bytecode
    COSTA: COSt and Termination Analyzer for Java Bytecode
        
        package conditional;
    
    public class Experiments {
    	int fi;
    	Experiments fx [];
    	int [] fa;
    	int [] fb;
    	int [] fc;
    
    	void m2 (Experiments o) {
    		while(o.fi > 0) {
    			fi--;
    		}
    	}
    
    	void m3 (int i, int j, int k) {
    		while(fa[i] > fb[j]) {
    			fc[k]++;
    		}	
    	}
    
    	
    	void m4 (int i, int j) {
    		while(fa[i] > 0) {
    			fb[i]--;
    			fa[j]++;
    		}
    	}
    	
    	void m5 (int [] a, int i, int j, int k) {
    		while(a[i] > 0) {
    			a[j] --;
    			a[k] --;
    		}
    	}
    
    	void m6 (int [] a, int i, int j, int k, int l) {
    		while(a[l] > 0) {
    			while(a[i] < 0) {
    				a[j] ++;
    				a[k] ++;
    			}
    			while(a[i] < 0) {
    				a[j] ++;
    			}
    			a[l] --;
    		}
    	}
    
    	void m7 (Experiments x, Experiments y, Experiments z) {
    		while(x.fi < y.fi) {
    			z.fi++;
    		}
    	}
    
    	void m8 (Experiments x, Experiments y, Experiments z, Experiments w) {
    		while( x.fi < y.fi) {
    			z.fi++;
    			w.fi--;
    		}
    	}
    
    	void m9 (Experiments x, Experiments y, Experiments z) {
    		m8 (x,y,x,z);
    	}
    	
    	
    	void m10 (Experiments x, Experiments y, int i) {
    		while(x.fa[fi] > 0) {
    			y.fb[i]--;
    		}
    	}
    	
    }