char **string_pool;

string_pool = malloc( sizeof(char *) * 1024);

scanf("%[^n]s", &string_pool[index]);

printf("gets %sn", &string_pool[index]);

push 1
read
gets

case GETS: {
        int index = popv(); // index is already on top of the stack
        int strl = strlen(&string_pool[index]);

        printf("gets %s with a length of %dn", &string_pool[index], strl);
        // pseudo code
        // push each char as integer on the stack
        foreach(char in string_pool[index]) push((int)char);

        break;
    }

    case READ: {
        int index = popv();
        scanf("%[^n]s", &string_pool[index]);
        break;
    }

    case WRITE: {
        int index = popv();
        printf("%s", &string_pool[index]);
        break;
    }

string_pool[0] = malloc( 100 );

char **string_pool;
string_pool = malloc( sizeof(char *) * 1024);

#define MAXCHR 2048
...

char buffer[MAXCHR];

fputs ("enter string: ", stdout);
if (fgets (buffer, MAXCHR, stdin) == NULL) {
    fputs ("(user canceled input.)n", stderr);
    return 1;
}

size_t len = strlen (buffer);   /* get the length of input (with 'n') */
if (len && buffer[len - 1] == 'n')    /* trim the 'n' from end */
    buffer[--len] = 0;          /* by overwriting with nul-character */


string_pool[index] = malloc (len + 1);      /* allocate storage for buffer */
if (string_pool[index] == NULL) {           /* validate allocation */
    perror ("maklloc-string_pool[index]");  /* handle error */
    return 1;  /* or break read loop; */
}
/* copy buffer to string_pool[index], advance index */
memcpy (string_pool[index++], buffer, len + 1);

int len = strlen(string_pool[index]);

char *ptr = string_pool[index];
while(*ptr){
    //use *ptr
    ptr++;
}

scanf("%[^n]s", string_pool[index]);

string_pool = malloc( sizeof(char *) * NO_STRS);
for(int i=0;i<NO_STRS; i++)
    string_pool[i] = malloc(sizeof(char) * STR_LEN);