/media/sda-magnetic/david/Dokumente-16-2024-08-01/informatikUmathematik/graph20240815html/david4/regexpr-unshrink/reg21.c

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct parsing_begin_end_state {
    int current;
    int begin;
    int end;
};

//char expr [] = "(a(((+bc(d))l+ll)de(faaa)))zzz";
#define MAX_STATES  1024
#define END           -1
char expr [] = "abc*de[f,asddsr]sdsda*ghijk";
int i = 0;
int j;
int state1 [MAX_STATES];
int state2 [MAX_STATES];
char statechar [MAX_STATES];

char gettoken () {
    return expr [i++];
}
void tokenback () {
    i--;
}

/*
aaaa
aaaaaa
aaaaaaa
aaaaaaaa()
*/

struct parsing_begin_end_state stream (struct parsing_begin_end_state);
struct parsing_begin_end_state followed (struct parsing_begin_end_state);
struct parsing_begin_end_state compound (struct parsing_begin_end_state);
struct parsing_begin_end_state or_operator (struct parsing_begin_end_state);
struct parsing_begin_end_state repeat_operator (struct parsing_begin_end_state);

struct parsing_begin_end_state or_operator (struct parsing_begin_end_state be_arg) {
    struct parsing_begin_end_state j1, j2, j3;
    int t;
    struct parsing_begin_end_state be;
    be.begin = -1;
    be.end = -1;
    be.current = -1;
    j1.begin = -1;
    j1.end = -1;
    j1.current = -1;
    j2.begin = -1;
    j2.end = -1;
    j2.current = -1;
    j3.begin = -1;
    j3.end = -1;
    j3.current = -1;

    struct parsing_begin_end_state TO_SUBS;
    struct parsing_begin_end_state empty;
    empty.begin = -1;
    empty.end = -1;
    empty.current = -1;
    
    if (gettoken () == '[') {
        j3.begin = END;
        j3.current = j;
        j3.end = j;
        j++;
        j1 = repeat_operator (j3);              //ACHTUNG!!!
        if (gettoken () != ',') {
            fprintf (stderr, "Komma vergessen");
            exit (1);
        }
        j2 = repeat_operator (j3);              //ACHTUNG!!!
        if (gettoken () != ']') {
            fprintf (stderr, "Klammer vergessen ]");
            exit (1);
        }
        state1 [j3.current] = j1.begin;
        state2 [j3.current] = j2.end;
        statechar [j3.current] = '#';
        j3 = repeat_operator (empty);         //ACHTUNG!!!
        if (j1.begin == END)
            state1 [j1.current] = j1.begin; //ACHTUNG j3 j1 eggal
        //state2 [j1] = j3;
        if (j2.begin == END)
            state1 [j2.current] = j2.begin;  //ACHTUNG j3 j2 egal
        //state2 [j2] = j3;
    }
    else { 
        tokenback ();
        j3.current = j;
        j3.begin = j;
        j3.end = j;
        j3 = repeat_operator (j3);         //ACHTUNG!!!
    }
return j3;
}

struct parsing_begin_end_state repeat_operator (struct parsing_begin_end_state be_arg) {
    struct parsing_begin_end_state j1;
    struct parsing_begin_end_state be;
    be.begin = -1;
    be.end = -1;
    be.current = -1;
    j1.begin = -1;
    j1.end = -1;
    j1.current = -1;
    
    if (gettoken () == '*') {
        be_arg.begin = -j;                   //ACHTUNG!!!
        j1 = stream (be_arg);
    }
    else { 
        tokenback ();                       //ACHTUNG -1
        j1 = stream (be_arg);
    }
return j1;
}

struct parsing_begin_end_state stream (struct parsing_begin_end_state be_arg) {
    struct parsing_begin_end_state be;
    be.begin = -1;
    be.end = -1;
    be.current = -1;

    compound (be_arg);
    return followed (be_arg);
}

struct parsing_begin_end_state followed (struct parsing_begin_end_state be_arg) {    
    struct parsing_begin_end_state j1, j2;
    struct parsing_begin_end_state t;
    struct parsing_begin_end_state be;
    be.begin = -1;
    be.end = -1;
    be.current = -1;
    j1.begin = -1;
    j1.end = -1;
    j1.current = -1;
    j2.begin = -1;
    j2.end = -1;
    j2.current = -1;
    struct parsing_begin_end_state TO_SUBS;

    
    int ch = gettoken ();
    if ((ch >= 'a') && (ch <= 'z')) {
        t = be_arg;
        t.end = j;
        j++;
        if (be_arg.begin > 0) {
            j2 = j1 = or_operator (be_arg);
        }
        else {
            j2 = j1 = or_operator (be_arg);
            j1.begin *= -5;
            //j2.begin =be_arg.begin;                //ACHTUNG
        }
        state1 [t.end] = j1.begin;
        state2 [t.end] = j2.end;
        statechar [t.end] = ch;
    }
    else {
        t.begin = END;
        t.current = END;
        t.end = END;
        tokenback ();
    }
return t;
}

struct parsing_begin_end_state compound (struct parsing_begin_end_state be_arg) {
    struct parsing_begin_end_state be;
    be.begin = -1;
    be.end = -1;
    be.current = -1;
    struct parsing_begin_end_state TO_SUBS;

    if (gettoken () == '(') {
        or_operator (TO_SUBS);
        if (gettoken () != ')') {
            fprintf (stderr, "fehler klammer vergessen %c %i\n", expr [i], i);
            exit (1);
        }
    }
    else
        tokenback ();
}


void init_end () {
    int k;
    for (k = 0;  k < MAX_STATES;  k++) {
        state1 [k] = END;
        state2 [k] = END;
    }
        
}

int main (void) {
    int k;
        struct parsing_begin_end_state TO_SUBS;
init_end ();
    or_operator (TO_SUBS);
    
    
    
    for (k = 0;  k < 24;  k++) {
        printf ("statechar [%i] = %c\n", k, statechar [k]);
        printf ("state1 [%i] = %i\n", k, state1 [k]);
        printf ("state2 [%i] = %i\n", k, state2 [k]);
    }
    
}