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 x10;
    
    
    class FRASimpleDist {
    
        //static long POLY = 0x0000000000000007L; // DZ
        //static long PERIOD = 1317624576693539401L; // DZ
    
        static int HPCC_starts(int n) {
    	return n;
            //int i; // DZ
    	//int j;
            //long m2[] = {}; // = Rail.make[long](64);
            //while (n < 0) n += PERIOD;
            //while (n > PERIOD) n -= PERIOD;
    	//
            //if (n == 0) return 0x1L;
            //long temp = 0x1;
            //for (i=0; i<64; i++) {
            //    m2[i] = temp;
            //    temp = (temp << 1) ^ (temp < 0 ? POLY : 0L);
            //    temp = (temp << 1) ^ (temp < 0 ? POLY : 0L);
            //}
            //for (i=62; i>=0; i--) if (((n >> i) & 1) != 0) break;
            //long ran = 0x2;
            //while (i > 0) {
            //    temp = 0;
            //    for (j=0; j<64; j++) if (((ran >> j) & 1) != 0) temp ^= m2[j];
            //    ran = temp;
            //    i -= 1;
            //    if (((n >> i) & 1) != 0)
            //        ran = (ran << 1) ^ (ran < 0 ? POLY : 0);
            //}
            //return ran;
        }
    
        static void randomAccessUpdate(int num_updates,
    				   int logLocalTableSize,
    				   int MAX_PLACES) {
    	Conc.finish_begin();
    	randomAccessUpdate_1(num_updates,logLocalTableSize,MAX_PLACES);
    	Conc.finish_end();
        }
        
        static void randomAccessUpdate_1(int num_updates,
    				     int logLocalTableSize,
    				     int MAX_PLACES) {
    	for (int p=0; p<MAX_PLACES; p++) {
                int valp = p;
    	    Conc.async_begin();
    	    randomAccessUpdate_2(num_updates,logLocalTableSize,MAX_PLACES,p,valp);
    	    Conc.async_end();
    	}
        }
    
        static void randomAccessUpdate_2(int num_updates,
    				     int logLocalTableSize,
    				     int MAX_PLACES,
    				     int p,
    				     int valp) {
    	//int ran = HPCC_starts(valp*(num_updates/MAX_PLACES)); // DZ
    	for (int i=0; i<num_updates/*/MAX_PLACES // DZ*/; i++) {
    	    Conc.async_begin();
    	    randomAccessUpdate_3();
    	    Conc.async_end();
    	}
        }
    
        static void randomAccessUpdate_3() {}   
    
        public static void main(String args[]) {
    	int MAX_PLACES = 16; //must be a power of 2
    
            int logLocalTableSize = args.length; //> 1 && args[0].equals("-m") ? Integer.parseInt(args[1]) : 12; // DZ
            int localTableSize = logLocalTableSize; //1<<logLocalTableSize; // DZ
            int tableSize = localTableSize*MAX_PLACES;
            int num_updates = 4*tableSize;
    
            randomAccessUpdate(num_updates,logLocalTableSize,MAX_PLACES);
    
            // repeat for testing.
            randomAccessUpdate(num_updates,logLocalTableSize,MAX_PLACES);
            for (int i=0; i<MAX_PLACES; i++) {
    	    Conc.async_begin();
    	    main_1();
    	    Conc.async_end();
    	}
        }
    
        static void main_1() {
    	//val table = tables(); // DZ
    	//int err = 0; // DZ
    	//for (int j=0; j<table.a.length; j++) // DZ
    	//    if (table.a(j) != j) err++; // DZ
    	//} // DZ
        }
        
    }