aadit/MIT-Curricular
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Upload files to "DS/C/Lab/Week6"

Browse source
This commit is contained in:
Aadit Agrawal 2024-09-03 11:27:33 +05:30
parent 5b8ed261ff
commit 8de2a08e83
3 changed files with 132 additions and 75 deletions
Download patch file Download diff file Expand all files Collapse all files

45
DS/C/Lab/Week6/PrefixToInfix.c
View file

@ -6,40 +6,51 @@
char stack[MAX_SIZE][MAX_SIZE];
int top = -1;
void push(const char* item) {
if (top >= MAX_SIZE - 1) {
void push(const char *item)
{
if (top >= MAX_SIZE - 1)
{
printf("Stack Overflow\n");
return;
}
strcpy(stack[++top], item);
}
char* pop() {
if (top < 0) {
char *pop()
{
if (top < 0)
{
printf("Stack Underflow\n");
return NULL;
}
return stack[top--];
}
int isOperator(char c) {
int isOperator(char c)
{
return (c == '+' || c == '-' || c == '*' || c == '/');
}
int isAlphanumeric(char c) {
int isAlphanumeric(char c)
{
return ((c >= '0' && c <= '9') || (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'));
}
void prefixToInfix(char* prefix) {
void prefixToInfix(char *prefix)
{
int len = strlen(prefix);
char temp[MAX_SIZE];
for (int i = len - 1; i >= 0; i--) {
if (isAlphanumeric(prefix[i])) {
for (int i = len - 1; i >= 0; i--)
{
if (isAlphanumeric(prefix[i]))
{
temp[0] = prefix[i];
temp[1] = '\0';
push(temp);
} else if (isOperator(prefix[i])) {
}
else if (isOperator(prefix[i]))
{
char op1[MAX_SIZE], op2[MAX_SIZE], result[MAX_SIZE];
strcpy(op1, pop());
strcpy(op2, pop());
@ -47,17 +58,17 @@ void prefixToInfix(char* prefix) {
push(result);
}
}
printf("Infix expression: %s\n", stack[top]);
}
int main() {
int main()
{
char prefix[MAX_SIZE];
printf("Enter prefix expression: ");
fgets(prefix, MAX_SIZE, stdin);
prefix[strcspn(prefix, "\n")] = 0; // Remove newline if present
gets(prefix);
prefixToInfix(prefix);
return 0;
}