魔王语言(C语言版)--栈的应用

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
char ans[10001];
char mp[10001];
char s[10000];
typedef struct Stack {char data;struct Stack* next;
}*sta;
//将栈初始化
void init(sta* now) {*now = NULL;
}
//判断栈时候为空
int isEmpty(sta now) {return now == NULL;
}
//入栈(头插)
void pushStack(sta* now, char e) {//为栈中新的节点开辟空间sta p = (sta)malloc(sizeof(struct Stack));//利用头插，将节点放入栈中p->data = e;p->next = *now;*now = p;
}
//出栈(头删)
void pop(sta* now) {if (isEmpty(*now)) {printf("栈空，无法出栈");exit(0);}sta p = *now;*now = p->next;free(p);}
//返回栈顶元素
char top(sta now) {if (isEmpty(now)) {printf("栈空，无法出栈\n");exit(0);}return now->data;
}
void Change() {char temp[10001]="";for (int i = 0; i < strlen(s); i++) {if (s[i] == 'B') {strcat(temp, "tAdA");}else {strncat(temp, &s[i], 1);}}strcpy(s, temp);temp[0] = '\0';for (int i = 0; i < strlen(s); i++) {if (s[i] == 'A') {strcat(temp, "sae");}else {strncat(temp, &s[i], 1);}}strcpy(s, temp);/*s = "";for (int i = 0; i < strlen(temp); i++) {if (temp[i] == 'A') {strcat(s, "sae");}else {strncat(s, &temp[i], 1);}}*/}void dfs(int pi) {sta st;init(&st);//记录下'（'后面的字母，方便后面使用char s1 = s[pi + 1];int ded;//用来标记')'的位置//为什么要从pi+2开始遍历//是为了将从pi+2开始的所有括号中的字母放入栈中//pi和pi+1已经记录下了for (int i = pi + 2; i < strlen(s); i++) {if (s[i] == '(') {dfs(i);//利用递归，消除嵌套的'()'}else if (s[i] == ')') {ded = i;break;}else {//将括号中的字母入栈//虽然st为一级指针，但是st的头会改变，需要传地址，利用二级指针//将括号中间的字母放入栈中pushStack(&st, s[i]);}}char p1[10001], p2[10001], p3[10001] = "";//将括号前的所有字母赋值给p1,这里也包括了'('strncpy(p1, s, pi+ 1);p1[pi + 1] = '\0';//将括号后的所有字母赋值给p2strncpy(p2, s + ded + 1, strlen(s) - ded - 1);p2[strlen(s) - ded - 1] = '\0';//将括号中的字母按照规律存放到p3中while (!isEmpty(st)) {//将括号中的第一个字母放入p3strncat(p3, &s1, 1);//将其他的字母按照规律放入p3char temp = top(st);strncat(p3, &temp,1);//将使用过的字母出栈，始终保持要使用的元素在栈顶pop(&st);}strncat(p3, &s1, 1);//将所有变换后的字母赋值给s//是为最后翻译过的字母sprintf(s, "%s%s%s", p1, p3, p2);
}
char* find() {char answer[10001];answer[0] = '\0';for (int i = 0; i < strlen(s); i++) {if (s[i] == '(') {//如果检测到'('要消去(,并要把()里面的字母按照规定排列dfs(i);//记录下'('的位置}else {strncat(answer, &s[i], 1);}}return answer;
}
void translate() {for (int i = 0; i < strlen(ans); i++) {if (ans[i] == 't') {printf("天");}else if (ans[i] == 'd') {printf("地");}else if (ans[i] == 's') {printf("上");}else if (ans[i] == 'a') {printf("一只");}else if (ans[i] == 'e') {printf("鹅");}else if (ans[i] == 'z') {printf("追");}else if (ans[i] == 'g') {printf("赶");}else if (ans[i] == 'x') {printf("下");}else if (ans[i] == 'n') {printf("蛋");}else if (ans[i] == 'h') {printf("恨");}}
}
Print() {int i = 0;for (i = 0; i < strlen(s); i++) {printf("%c", s[i]);}
}
int main() {printf("请输入魔王语言：");scanf("%s", s);//将A转化为sae,将B转化为tAdAChange();strcpy(ans, find());printf("整理后的魔王语言为:\n");printf("%s\n", ans);printf("翻译后的魔王语言是：\n");translate();return 0;
}