tsounakis

Untitled

Jun 1st, 2020
348
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 3.84 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <string.h>
  3. #include <stdlib.h>
  4.  
  5. /* things for the inputs regarding to the gates */
  6. typedef struct data
  7. {
  8.     int value;
  9.     struct data * next;
  10. } Data;
  11.  
  12. typedef Data * DataList;
  13.  
  14. typedef int (*CallBack)(DataList);
  15.  
  16. Data * createData(int value)
  17. {
  18.     Data * dataptr;
  19.     dataptr = malloc(sizeof(Data));
  20.     dataptr -> value = value;
  21.     dataptr -> next = NULL;
  22.     return dataptr;
  23. }
  24.  
  25. void appendData(DataList *lstptr, Data * newptr)
  26. {
  27.     if (*lstptr == NULL)
  28.     {
  29.         *lstptr = newptr;
  30.         return;
  31.     }
  32.     appendData(&((*lstptr)->next), newptr);
  33.     return;
  34. }
  35. /*end*/
  36.  
  37. /*LG*/
  38. int myandlst(DataList);
  39. int myorlst(DataList);
  40. int mynorlst(DataList);
  41. int mynandlst(DataList);
  42. int myxorlst(DataList);
  43. /*end*/
  44.  
  45.  
  46. /*GATES*/
  47. typedef struct gate
  48. {
  49.     CallBack f;
  50.     int n;
  51.     struct gate ** inputs;
  52. } Gate;
  53.  
  54. Gate * creategate(CallBack f, int n)
  55. {
  56.     Gate * temp ;
  57.     temp = malloc(sizeof (Gate));
  58.     temp->f = f;
  59.     temp->n = n;
  60.     temp->inputs = malloc(sizeof(int*)*(temp -> n));
  61.     return temp;
  62. }
  63. /*end*/
  64.  
  65. int getinput()
  66. {
  67.     int x;
  68.     scanf("%d", &x);
  69.     return x;
  70. }
  71.  
  72. int eval(Gate *x) ;
  73.  
  74. int main( )
  75. {
  76.     Gate * ptr_ins[8], * ptr_gate[7];
  77.     int i;
  78.     printf("Please insert the inputs (binary): \n");
  79.    
  80.     for (i=0; i<8; i++)
  81.     {
  82.         ptr_ins[i] = creategate(getinput, 0);
  83.     }
  84.    
  85.     ptr_gate[0] = creategate(myandlst, 2);
  86.     ptr_gate[1] = creategate(myorlst, 2);
  87.     ptr_gate[2] = creategate(mynorlst, 2);
  88.     ptr_gate[3] = creategate(myxorlst, 3);
  89.     ptr_gate[4] = creategate(mynandlst, 3);
  90.     ptr_gate[5] = creategate(myorlst, 2);
  91.     ptr_gate[6] = creategate(myorlst, 2);
  92.    
  93.     ptr_gate[2] -> inputs = calloc(2, sizeof(int*));
  94.     ptr_gate[2] -> inputs[0] = ptr_ins[0];
  95.     ptr_gate[2] -> inputs[1] = ptr_ins[1];
  96.    
  97.     ptr_gate[0] -> inputs = calloc(2, sizeof(int*));
  98.     (ptr_gate[0] -> inputs)[0] = ptr_ins[2];
  99.     (ptr_gate[0] -> inputs)[1] = ptr_ins[3];
  100.    
  101.     ptr_gate[1] -> inputs = calloc(2, sizeof(int*));
  102.     (ptr_gate[01] -> inputs)[0] = ptr_ins[4];
  103.     (ptr_gate[01] -> inputs)[1] = ptr_ins[5];
  104.    
  105.     ptr_gate[6] -> inputs = calloc(2, sizeof(int*));
  106.     (ptr_gate[06] -> inputs)[0] = ptr_ins[6];
  107.     (ptr_gate[06] -> inputs)[1] = ptr_ins[7];
  108.    
  109.     ptr_gate[4] -> inputs = calloc(3, sizeof(int*));
  110.     (ptr_gate[04] -> inputs)[0] = ptr_gate[2];
  111.     (ptr_gate[04] -> inputs)[1] = ptr_gate[0];
  112.     (ptr_gate[04] -> inputs)[2] = ptr_gate[1];
  113.    
  114.     ptr_gate[3] -> inputs = calloc(3, sizeof(int*));
  115.     (ptr_gate[03] -> inputs)[0] = ptr_gate[0];
  116.     (ptr_gate[03] -> inputs)[1] = ptr_gate[1];
  117.     (ptr_gate[3] -> inputs)[2] = ptr_gate[6];
  118.    
  119.     ptr_gate[5] -> inputs = calloc(2, sizeof(int*));
  120.     (ptr_gate[5] -> inputs)[0] = ptr_gate[4];
  121.     (ptr_gate[5] -> inputs)[1] = ptr_gate[3];
  122.    
  123.     printf("The output is %d.", eval(ptr_gate[5]));
  124.    
  125.     return 0;
  126. }
  127.  
  128. /*LGs*/
  129. int myandlst (DataList datalist)
  130. {
  131.     return (datalist -> next == NULL ? datalist -> value : datalist->value * myandlst(datalist->next));
  132. }
  133.  
  134. int myorlst (DataList datalist)
  135. {
  136.     return (datalist -> next == NULL ? datalist -> value : datalist->value + myorlst(datalist->next) > 0);
  137. }
  138.  
  139. int mynorlst (DataList datalist)
  140. {
  141.     return !(myorlst(datalist));
  142. }
  143.  
  144. int mynandlst (DataList datalist)
  145. {
  146.     return !(myandlst(datalist));
  147. }
  148.  
  149. int myxorlst (DataList datalist)
  150. {
  151.     Data * iterator;
  152.     int sum = 0;
  153.     iterator = datalist;
  154.    
  155.     while (iterator != NULL)
  156.     {
  157.         sum += iterator -> value;
  158.         iterator = iterator -> next;
  159.     }
  160.    
  161.     return sum % 2 ? 1 : 0;
  162. }
  163.  
  164.  
  165. int eval(Gate *x)
  166. {
  167.     int b = 1, i;
  168.     DataList ins = NULL;
  169.     DataList ins2 = NULL;
  170.    
  171.     ins2 = createData(0);
  172.     appendData(&ins2, createData(0));
  173.    
  174.    
  175.     for (i=0; i < (x -> n); i++)
  176.     {
  177.         if ((x -> f) != getinput)
  178.         {
  179.             if (i == 0)
  180.                 ins = createData(eval((x -> inputs)[i]));
  181.             else if (i != 0)
  182.             {
  183.                 appendData(&ins, createData(eval((x -> inputs)[i])));
  184.                 b = 0;
  185.             }
  186.         }
  187.         else
  188.             break;
  189.     }
  190.     return (b == 1 ? (x->f)(ins2) : (x->f)(ins));
  191. }
  192. /*end*/
Advertisement
Add Comment
Please, Sign In to add comment