mk757ye/usaa20
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Update 'a2/program.c'

Browse Source
This commit is contained in:
Maryna Kravtsova 2020-10-24 16:50:10 +00:00
parent adc2849984
commit ffb35f129d
1 changed files with 36 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

51
a2/program.c
View File

@ -9,6 +9,8 @@ struct stack{
int size; int size;
}stack; }stack;
///add bracket to stack
void push(char ch){ void push(char ch){
if(stack.size < 100){ if(stack.size < 100){
stack.size++; stack.size++;
@ -18,6 +20,8 @@ void push(char ch){
exit(0); exit(0);
} }
///if i have opening bracket in stack, then decrement size
void pop(){ void pop(){
if(stack.size >= 0) if(stack.size >= 0)
stack.size--; stack.size--;
@ -25,6 +29,8 @@ void pop(){
exit(0); exit(0);
} }
///compare brackets
bool find_pair(char a, char b){ bool find_pair(char a, char b){
if(a == '(' && b == ')') if(a == '(' && b == ')')
return true; return true;
@ -36,8 +42,10 @@ bool find_pair(char a, char b){
return true; return true;
return false; return false;
} }
///function to find right pair
char right_pair(char a){ char right_pair(char a){
char b; char b;
if(a == '(') if(a == '(')
@ -52,6 +60,8 @@ char right_pair(char a){
return b; return b;
} }
///find the last opening bracket in the stack
char gettop(){ char gettop(){
return stack.data[stack.size]; return stack.data[stack.size];
} }
@ -68,53 +78,60 @@ int main(){
int l = strlen(line); int l = strlen(line);
int i, j = -1, f = -1;; int i, j = -1, f = -1;;
char *l_bracket = calloc(l, sizeof(char)); char *o_bracket = calloc(l, sizeof(char));
char *r_bracket = calloc(l, sizeof(char)); char *c_bracket = calloc(l, sizeof(char));
for(i = 0; i < l; i++){ for(i = 0; i < l; i++){
if(line[i] == '{' || line[i] == '(' || line[i] == '[' || line[i] == '<'){ if(line[i] == '{' || line[i] == '(' || line[i] == '[' || line[i] == '<'){
push(line[i]); push(line[i]);
j++; j++;
f++; f++;
l_bracket[j] = gettop(); o_bracket[j] = gettop(); //get opening bracket from the stack
r_bracket[f] = right_pair(l_bracket[j]); c_bracket[f] = right_pair(o_bracket[j]); //get closing bracket
} }
if(line[i] == '}' || line[i] == ')' || line[i] == ']' || line[i] == '>'){ if(line[i] == '}' || line[i] == ')' || line[i] == ']' || line[i] == '>'){
if(stack.size == -1){
if(stack.size == -1){ //if there is no opening bracket in the stack
printf("Unexpected closing bracket %c in %d\n", line[i], i); printf("Unexpected closing bracket %c in %d\n", line[i], i);
return 0; return 0;
} }
else if(!find_pair(gettop(), line[i])){ else if(!find_pair(gettop(), line[i])){ //if there is another closing bracket
printf("Crossed bracket %c in %d, expected %c \n", line[i], i, r_bracket[f]); printf("Crossed bracket %c in %d, expected %c \n", line[i], i, c_bracket[f]);
return 0; return 0;
} }
else{ else{
r_bracket[f] = 0; c_bracket[f] = 0; //if closing bracket is correct then reducee array
f--; f--; //if i didn't find a correct bracket, then keep it in the array
pop(); pop();
} }
} }
} }
int begin = 0; int begin = 0;
int end = strlen(r_bracket); int end = strlen(c_bracket);
int temp; int temp;
//now i have all missing closing brackets in array
//flip array
while(begin < end){ while(begin < end){
temp = r_bracket[begin]; temp = c_bracket[begin];
r_bracket[begin++] = r_bracket[--end]; c_bracket[begin++] = c_bracket[--end];
r_bracket[end] = temp; c_bracket[end] = temp;
} }
//if program pop all opening brackets from the stack, then stack size must be -1;
if(stack.size == -1){ if(stack.size == -1){
printf("All brackets OK\n"); printf("All brackets OK\n");
} }
//if no, then program didn't find closing bracket
else { else {
printf("Missing closing brackets: %s\n", r_bracket); printf("Missing closing brackets: %s\n", c_bracket);
} }
free(l_bracket); free(o_bracket);
free(r_bracket); free(c_bracket);
return 0; return 0;
} }