String-Pattern-Matching-Algorithm/main.c at master · ndraiman/String-Pattern-Matching-Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "slist.h"
#include "pattern_matching.h"

// void print_list(slist_t*);


int main() {

  printf("\n********************\n**** Main START ****\n********************\n");

                                                                                                                                                                                                                                                                                                                                                                                                      // slist_t* list = (slist_t*)malloc(sizeof(slist_t));
    // slist_t* list2 = (slist_t*)malloc(sizeof(slist_t));
    //
    // slist_init(list);
    // slist_init(list2);
    //
    // int x = 5;
    // int y = 8;
    //
    // printf("\n*** adding to list ***\n");
    // slist_append(list, &x);
    // slist_prepend(list, &y);
    // printf("\n*** adding to list2 ***\n");
    // slist_append(list2, &x);
    // slist_prepend(list2, &y);
    //
    //
    // printf("\n*** Pop list ***\n");
    // slist_pop_first(list);
    //
    //
    // printf("\n*** Appending lists ***\n");
    // slist_append_list(list, list2);
    //
    //
    // printf("\n*** Destroying lists ***\n");
    // slist_destroy(list, SLIST_LEAVE_DATA);
    // slist_destroy(list2, SLIST_LEAVE_DATA);
    //
    // free(list);
    // free(list2);

    printf("\n********************\n***** Testing pattern_matching *****\n********************\n");

    pm_t* fsm = (pm_t*)malloc(sizeof(pm_t));

    int returned;
    returned = pm_init(fsm);
    printf("pm_init returned %d\n", returned);

    unsigned char* string;

    printf("*******************************\n");
    string = "a";
    printf("adding string: %s\n", string);
    returned = pm_addstring(fsm, string, 1);
    printf("pm_addstring returned %d\n", returned);

    printf("*******************************\n");

    string = "abc";
    printf("adding string: %s\n", string);
    returned = pm_addstring(fsm, string, 3);
    printf("pm_addstring returned %d\n", returned);

    printf("*******************************\n");

    string = "bca";
    printf("adding string: %s\n", string);
    returned = pm_addstring(fsm, string, 3);
    printf("pm_addstring returned %d\n", returned);

    printf("*******************************\n");

    string = "cab";
    printf("adding string: %s\n", string);
    returned = pm_addstring(fsm, string, 3);
    printf("pm_addstring returned %d\n", returned);

    printf("*******************************\n");

    string = "acb";
    printf("adding string: %s\n", string);
    returned = pm_addstring(fsm, string, 3);
    printf("pm_addstring returned %d\n", returned);

    printf("*******************************\n");

    string = "abc";
    printf("adding string: %s\n", string);
    returned = pm_addstring(fsm, string, 3);
    printf("pm_addstring returned %d\n", returned);

    printf("*******************************\n");
    printf("*******************************\n");
    printf("*******************************\n");

    printf("computing failure functions\n");
    returned = pm_makeFSM(fsm);
    printf("pm_makeFSM returned %d\n", returned);

    // slist_node_t* p = fsm->zerostate->slist_head(_transitions);
    // pm_state_t* stateA = ((pm_labeled_edge_t*)slist_data(p))->state;
    // printf("stateA id = %d, output = %s\n", stateA->id, (char*)stateA->slist_data(slist_head(output)));

    printf("*******************************\n");

    string = "xyzabcabde";
    printf("searching for string \"%s\"\n", string);
    slist_t* matched = pm_fsm_search(fsm->zerostate, string, strlen(string));
    // printf("matched list:\n");
    // print_list3(matched);
    printf("destroying matched list...\n");
    slist_destroy(matched, SLIST_FREE_DATA);

    printf("*******************************\n");
    printf("*******************************\n");

    printf("Destroying fsm\n");
    pm_destroy(fsm);
    printf("pm_destroy finished\n");

    printf("\n********************\n***** Main END *****\n********************\n");

    return 0;
}


// void print_list(slist_t* list) {
//     printf("print_list() \n");
//
//     slist_node_t* p;
//     int i = 0;
//
//     for(p = slist_head(list); p != NULL; p = slist_next(p)) {
//
//         i++;
//         printf("[%d] -> ", *(int*)slist_data(p));
//     }
//
//     printf("|| \n");
//
// }