コード例 #1
0
ファイル: makebasic.c プロジェクト: JPLaska/nlp-tree
void dfaSetup(int ns, int os, int *offsets)
{
  int i;

  invariant(os<=MAX_VARIABLES);

  MAKE_SEQUENTIAL_LIST(sub_results, unsigned, 64);
  
  no_states = ns;

  offsets_size = os;
  for (i = 0; i < offsets_size; i++) {
    sorted_indices[i] = i;
    global_offsets[i] = offsets[i];
  }

  qsort(sorted_indices, offsets_size, sizeof(int), &offsets_cmp);

  aut = dfaMake(no_states);

  aut->ns = no_states;
  aut->s = 0;
}
コード例 #2
0
ファイル: external.c プロジェクト: ondrik/mona-vata
DFA *dfaImport(char* filename, char ***vars, int **orders)
{
  unsigned int i, numvars, bdd_nodes, ns, s;
  FILE *file;
  DFA *a;
  char ts[100];
  int ti;

  /* Read file */
  if ((file = fopen(filename, "r")) == 0) 
    return 0;

  fscanf(file,
	 "MONA DFA\n"
	 "number of variables: %u\n"
	 "variables: ", &numvars);
  if (vars) {
    *vars = (char **) mem_alloc(sizeof(char *) * (numvars + 1));
    (*vars)[numvars] = 0;
    for (i = 0; i < numvars; i++) {
      (*vars)[i] = (char *) mem_alloc(100);
      fscanf(file, " %s ", (*vars)[i]);
    }
  }
  else {
    for (i = 0; i < numvars; i++)
      fscanf(file, " %s ", ts);
  }
  fscanf(file,
	 "orders: ");
  if (orders) {
    *orders = (int *) mem_alloc(sizeof(int) * numvars);
    for (i = 0; i < numvars; i++)
      fscanf(file, " %d ", &((*orders)[i]));
  }
  else
    for (i = 0; i < numvars; i++)
      fscanf(file, " %d ", &ti);
  if (fscanf(file,
             "states: %u\n"
             "initial: %u\n"
             "bdd nodes: %u\n"
             "final:", 
             &ns, &s, &bdd_nodes) != 3) 
    return 0;
  a = dfaMake(ns);
  a->s = s;

  for (i = 0; i<a->ns; i++)
    fscanf(file, " %d", &a->f[i]);

  fscanf(file, "\nbehaviour:");
  for (i = 0; i < a->ns; i++)
    fscanf(file, " %u", &a->q[i]);

  fscanf(file, "\nbdd:\n");
  table = (BddNode *) mem_alloc(sizeof(BddNode)*bdd_nodes);
  
  for (i = 0; i < bdd_nodes; i++) {
    table[i].p = -1;
    fscanf(file, "%i %u %u\n", 
           &table[i].idx,
           &table[i].lo,
           &table[i].hi);
  }
  
  if (fgetc(file) != 'e' ||
      fgetc(file) != 'n' ||
      fgetc(file) != 'd') 
    return 0;
  fclose(file);

  /* fill bdd-manager */
  import_bddm = a->bddm;
  for (i = 0; i < a->ns; i++) 
    a->q[i] = make_node(a->q[i]);

  mem_free(table);
  return a;
}
コード例 #3
0
ファイル: external.c プロジェクト: SRI-CSL/PVS
DFA *dfaImport(char* filename, char ***vars, int **orders)
{
  int i, numvars, bdd_nodes, ns, s;
  FILE *file;
  DFA *a;
  char ts[100];
  int ti;

  fprintf(stderr, "IN dfaImport\n");
  fflush(stderr);
  
  /* Read file */
  if ((file = fopen(filename, "r")) == 0) 
    return NULL;

  /*
   * BD: we should check the return value of every call to fscanf.
   */
  if (fscanf(file,
	     "MONA DFA\n"
	     "number of variables: %u\n"
	     "variables: ", &numvars) != 1) {
    return NULL;
  }

  /*
   * BD: allocate vars and order arrays here if needed.
   * Also initialize a and table to NULL in case we need to clean up.
   */
  a = NULL;
  table = NULL;
  if (vars) {
    *vars = (char **) mem_alloc(sizeof(char *) * (numvars + 1));
    // BD: initialize all to NULL so that we can release memory
    // in case of a read or format error.
    //    (*vars)[numvars] = 0;
    for (i=0; i<= numvars; i++) {
      (*vars)[i] = NULL;
    }
  }
  if (orders) {
    *orders = (int *) mem_alloc(sizeof(int) * numvars);
  }


  if (vars) {
    for (i = 0; i < numvars; i++) {
      (*vars)[i] = (char *) mem_alloc(100);
      if (fscanf(file, " %s ", (*vars)[i]) != 1) {
	goto cleanup;
      }
    }
  }
  else {
    for (i = 0; i < numvars; i++) {
      if (fscanf(file, " %s ", ts) != 1) {
	goto cleanup;
      }
    }
  }
  if (fscanf(file, "orders: ") != 0) {
    goto cleanup;
  }
  if (orders) {
    for (i = 0; i < numvars; i++)
      if (fscanf(file, " %d ", &((*orders)[i])) != 1) {
	goto cleanup;
      }
  }
  else {
    for (i = 0; i < numvars; i++) {
      if (fscanf(file, " %d ", &ti) != 1) {
	goto cleanup;
      }
    }
  }

  if (fscanf(file,
             "states: %u\n"
             "initial: %u\n"
             "bdd nodes: %u\n"
             "final:", 
             &ns, &s, &bdd_nodes) != 3) {
    goto cleanup;
  }

  a = dfaMake(ns);
  a->s = s;

  for (i = 0; i<a->ns; i++) {
    if (fscanf(file, " %d", &a->f[i]) != 1) {
      goto cleanup;
    }
  }

  if (fscanf(file, "\nbehaviour:") != 0) {
    goto cleanup;
  }
  for (i = 0; i < a->ns; i++) {
    if (fscanf(file, " %u", &a->q[i]) != 1) {
      goto cleanup;
    }
  }

  if (fscanf(file, "\nbdd:\n") != 0) {
    goto cleanup;
  }
  table = (BddNode *) mem_alloc(sizeof(BddNode)*bdd_nodes);
  
  for (i = 0; i < bdd_nodes; i++) {
    table[i].p = -1;
    if (fscanf(file, "%i %u %u\n", 
	       &table[i].idx,
	       &table[i].lo,
	       &table[i].hi) != 3) {
      goto cleanup;
    }
  }
  
  if (fgetc(file) != 'e' || fgetc(file) != 'n' || fgetc(file) != 'd') {
    goto cleanup;
  }

  fclose(file);

  /* fill bdd-manager */
  import_bddm = a->bddm;
  for (i = 0; i < a->ns; i++) 
    a->q[i] = make_node(a->q[i]);

  mem_free(table);
  return a;

 cleanup:
  fclose(file);
  if (table != NULL) {
    mem_free(table);
  }
  if (a != NULL) {
    dfaFree(a);
  }
  if (orders) {
    mem_free(*orders);
  }
  if (vars) {
    i = 0;
    while ((*vars)[i] != NULL) {
      mem_free((*vars)[i]);
      i ++;
    }
    mem_free(*vars);
  }

  return NULL;
}