help with a struct{} table[]

[TMS]

I have an assignment to write a recursive descent parser. I have a struct that I've defined that has a table after it. I have NEVER done it this way before, and I'm hoping someone can help me access the table. I put the struct inside of main because that is where I've seen it done (surfing the web). If that is wrong, please say so. Here is my code:

typedef enum{ 
    repeat, 
    begin, 
    stmt, 
    end, 
    until, 
    cond, 
    semi_colon,
}token_t;
 
 
int main(int argc, char* argv[])
{
    struct parseMe
    {
    token_t tok;
    char *word;
    } table[] = {
        {repeat, "repeat"}, {begin, "begin"}, {stmt, "stmt"},
        {end, "end"}, {until, "until"}, {cond, "cond"}, {semi_colon, ";"}
        };
 
 
    ifstream infile, newFile;
    char parser[] = "repeat begin stmt end until cond ;";
 
    char delims[] = " ";
    char *result = NULL;
    result = strtok(parser, delims);
    while(result != NULL)
    {
        cout << "Token=" << result << endl;
        result = strtok(NULL, delims);
 
    }
    if(strcmp(word,"repeat")==0) tok = repeat;  //THIS IS WHERE MY PROBLEM IS!!!
    cout << tok;
    return 0;
}
 

I sort of marked where I'm having a problem. I want to compare my parser array to the table, and I'm having a real hard time figuring out how to do that. I thought my code was solid, but it seems not. I get an error saying that word is an undeclared identifier. So, I tried to make an object using the struct, but, alas, I've not really used structs that much (maybe once!!!). But this is how I was told to do it, and I'm learning, just need another bit of help.

Thank you

[Banfa]

if(strcmp(word,"repeat")==0) tok = repeat;

You do not have a variable named word, word is a member of your struct called parse me. You have a variable of this type called table so this could be written as

if(strcmp(table[0].word,"repeat")==0) tok = repeat;

however that would compare "repeat" (in the table) with "repeat", i.e. it will always be true.

I think what you need to do is as you tokenise your string compare the token, pointer to by result, with each entry in the table to find out which word this token is.