Here is the code i have written so far, please finish it #include #include int i=-1; int nextstate=0; cstack top; init_cstack(&top); while(1)    switch{    case 0: i++;        if (is_open(my_input[i]))            nextstate= 1;        else if (is_close(my_input[i]))            nextstate= 2;        else if (my_input[i] == '\0')            nextstate= 3;        else            nextstate= 4;        break;    case 1: if(!is_cfull()){            cpush(&top, my_input[i]);            nextstate= 0;        }        else{            printf("Error! Stack is full\n");            exit(0);        }        break;    case 2: if (!is_cempty(top)){            if(is_brother(cpop(&top), my_input[i])){                nextstate= 0;            }            else{                printf("Error! Delimiter do not match\n");                return FALSE;            }        }        else{            printf("No open delimiter to compare to\n");            return FALSE;        }        break;    case 3: if (is_cempty(top)){            return TRUE;        }        else{            printf("Error! Extra open delimiter\n");            return FALSE;        }        break;    case 4: nextstate =0;        break;    } }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Here is the code i have written so far, please finish it

#include <stdio.h>
#include <cstack.c>

int i=-1;
int nextstate=0;
cstack top;

init_cstack(&top);
while(1)
   switch{
   case 0: i++;
       if (is_open(my_input[i]))
           nextstate= 1;
       else if (is_close(my_input[i]))
           nextstate= 2;
       else if (my_input[i] == '\0')
           nextstate= 3;
       else
           nextstate= 4;
       break;
   case 1: if(!is_cfull()){
           cpush(&top, my_input[i]);
           nextstate= 0;
       }
       else{
           printf("Error! Stack is full\n");
           exit(0);
       }
       break;
   case 2: if (!is_cempty(top)){
           if(is_brother(cpop(&top), my_input[i])){
               nextstate= 0;
           }
           else{
               printf("Error! Delimiter do not match\n");
               return FALSE;
           }
       }
       else{
           printf("No open delimiter to compare to\n");
           return FALSE;
       }
       break;
   case 3: if (is_cempty(top)){
           return TRUE;
       }
       else{
           printf("Error! Extra open delimiter\n");
           return FALSE;
       }
       break;
   case 4: nextstate =0;
       break;
   }
}

        

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Array
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education