Lab for Automated Reasoning and Analysis LARA

Translate manually into bytecodes using the techniques in Compilation as Tree Transformation

int activityLevel
boolean action(int signals, boolean objects, int smart, int pretty) {
  if ((signals > 5 || !objects) && smart + 2*pretty > 10) {
    activityLevel++;
    return true;
  } else {
    activityLevel--;
    return false;
  }
}

Solution

 
cc09/exercises_08.txt · Last modified: 2009/11/10 23:33 by losa
 
© EPFL 2018 - Legal notice