fork download

copy

#include<stdio.h>
#include<stdlib.h>
#define bool int
 
/* structure of a stack node */
struct sNode
{
char data;
struct sNode *next;
};
 
/* Function to push an item to stack*/
void push(struct sNode** top_ref, int new_data);
 
/* Function to pop an item from stack*/
int pop(struct sNode** top_ref);
 
/* Returns 1 if character1 and character2 are matching left
and right Parenthesis */
bool isMatchingPair(char character1, char character2)
{
if (character1 == '(' && character2 == ')')
	return 1;
else if (character1 == '{' && character2 == '}')
	return 1;
else if (character1 == '[' && character2 == ']')
	return 1;
else
	return 0;
}
 
/*Return 1 if expression has balanced Parenthesis */
bool areParenthesisBalanced(char exp[])
{
int i = 0;
 
/* Declare an empty character stack */
struct sNode *stack = NULL;
 
/* Traverse the given expression to check matching parenthesis */
while (exp[i])
{
	/*If the exp[i] is a starting parenthesis then push it*/
	if (exp[i] == '{' || exp[i] == '(' || exp[i] == '[')
		push(&stack, exp[i]);
 
	/* If exp[i] is a ending parenthesis then pop from stack and 
		check if the popped parenthesis is a matching pair*/
	if (exp[i] == '}' || exp[i] == ')' || exp[i] == ']')
	{
 
		/*If we see an ending parenthesis without a pair then return false*/
		if (stack == NULL)
		return 0; 
 
		/* Pop the top element from stack, if it is not a pair 
			parenthesis of character then there is a mismatch.
			This happens for expressions like {(}) */
		else if ( !isMatchingPair(pop(&stack), exp[i]) )
		return 0;
	}
	i++;
}
 
/* If there is something left in expression then there is a starting
	parenthesis without a closing parenthesis */
if (stack == NULL)
	return 1; /*balanced*/
else
	return 0; /*not balanced*/
} 
 
/* UTILITY FUNCTIONS */
/*driver program to test above functions*/
int main()
{
char exp[100] = "{()}[]";
if (areParenthesisBalanced(exp))
	printf("\n Balanced ");
else
	printf("\n Not Balanced "); 
return 0;
} 
 
/* Function to push an item to stack*/
void push(struct sNode** top_ref, int new_data)
{
/* allocate node */
struct sNode* new_node =
			(struct sNode*) malloc(sizeof(struct sNode));
 
if (new_node == NULL)
{
	printf("Stack overflow \n");
	getchar();
	exit(0);
}		 
 
/* put in the data */
new_node->data = new_data;
 
/* link the old list off the new node */
new_node->next = (*top_ref); 
 
/* move the head to point to the new node */
(*top_ref) = new_node;
}
 
/* Function to pop an item from stack*/
int pop(struct sNode** top_ref)
{
char res;
struct sNode *top;
 
/*If stack is empty then error */
if (*top_ref == NULL)
{
	printf("Stack overflow \n");
	getchar();
	exit(0);
}
else
{
	top = *top_ref;
	res = top->data;
	*top_ref = top->next;
	free(top);
	return res;
}
}
 

Main.java:1: error: illegal character: '#'
#include<stdio.h>
^
Main.java:1: error: class, interface, or enum expected
#include<stdio.h>
        ^
Main.java:2: error: illegal character: '#'
#include<stdlib.h>
^
Main.java:3: error: illegal character: '#'
#define bool int
^
Main.java:9: error: class, interface, or enum expected
struct sNode *next;
^
Main.java:10: error: class, interface, or enum expected
};
^
Main.java:13: error: class, interface, or enum expected
void push(struct sNode** top_ref, int new_data);
^
Main.java:16: error: class, interface, or enum expected
int pop(struct sNode** top_ref);
^
Main.java:20: error: class, interface, or enum expected
bool isMatchingPair(char character1, char character2)
^
Main.java:24: error: class, interface, or enum expected
else if (character1 == '{' && character2 == '}')
^
Main.java:26: error: class, interface, or enum expected
else if (character1 == '[' && character2 == ']')
^
Main.java:28: error: class, interface, or enum expected
else
^
Main.java:30: error: class, interface, or enum expected
}
^
Main.java:38: error: class, interface, or enum expected
struct sNode *stack = NULL;
^
Main.java:41: error: class, interface, or enum expected
while (exp[i])
^
Main.java:49: error: class, interface, or enum expected
	if (exp[i] == '}' || exp[i] == ')' || exp[i] == ']')
	^
Main.java:59: error: class, interface, or enum expected
		else if ( !isMatchingPair(pop(&stack), exp[i]) )
		^
Main.java:61: error: class, interface, or enum expected
	}
	^
Main.java:63: error: class, interface, or enum expected
}
^
Main.java:69: error: class, interface, or enum expected
else
^
Main.java:71: error: class, interface, or enum expected
} 
^
Main.java:78: error: class, interface, or enum expected
if (areParenthesisBalanced(exp))
^
Main.java:80: error: class, interface, or enum expected
else
^
Main.java:82: error: class, interface, or enum expected
return 0;
^
Main.java:83: error: class, interface, or enum expected
} 
^
Main.java:92: error: class, interface, or enum expected
if (new_node == NULL)
^
Main.java:95: error: class, interface, or enum expected
	getchar();
	^
Main.java:96: error: class, interface, or enum expected
	exit(0);
	^
Main.java:97: error: class, interface, or enum expected
}		 
^
Main.java:103: error: class, interface, or enum expected
new_node->next = (*top_ref); 
^
Main.java:106: error: class, interface, or enum expected
(*top_ref) = new_node;
^
Main.java:107: error: class, interface, or enum expected
}
^
Main.java:113: error: class, interface, or enum expected
struct sNode *top;
^
Main.java:116: error: class, interface, or enum expected
if (*top_ref == NULL)
^
Main.java:119: error: class, interface, or enum expected
	getchar();
	^
Main.java:120: error: class, interface, or enum expected
	exit(0);
	^
Main.java:121: error: class, interface, or enum expected
}
^
Main.java:125: error: class, interface, or enum expected
	res = top->data;
	^
Main.java:126: error: class, interface, or enum expected
	*top_ref = top->next;
	^
Main.java:127: error: class, interface, or enum expected
	free(top);
	^
Main.java:128: error: class, interface, or enum expected
	return res;
	^
Main.java:129: error: class, interface, or enum expected
}
^
42 errors

Standard output is empty