简单表达式翻译器

最新推荐文章于 2020-04-21 10:57:18 发布

plasticplane

最新推荐文章于 2020-04-21 10:57:18 发布

阅读量868

点赞数 1

分类专栏： C/C++

本文链接：https://blog.csdn.net/plasticplane/article/details/14001149

版权

1 篇文章 0 订阅

订阅专栏

构造一个中缀表达式到后缀表达式的翻译器，初步了解递归下降语法分析原理及语法制导翻译的过程。包含+,-,*,/,()

expr ------> expr + term {print(‘+’)}

| expr - term {print(‘-’)}

| term

term -----> term * factor {print(‘*’)}

| term / factor {print(‘/’)}

| factor

factor ----> ( expr )

| id {print(id.lexeme)}

| num {print(num.value)}

点击(此处)折叠或打开

#include<stdio.h>
#include<ctype.h>
void expr();
int lookahead;
void match(int t)
{
if (lookahead == t)
lookahead = getchar();
else {
printf("syntax error!");
return;
}
}
void factor()
{
if (isdigit(lookahead)){
printf("%c",lookahead);match(lookahead);
}else if(lookahead == '('){
match('(');expr();match(')');
}else if((lookahead >='a'&&lookahead <='z')||(lookahead >='A'&&lookahead <='Z')){
printf("%c",lookahead);match(lookahead);factor();
}
}
void term()
{
factor();
while(1){
if(lookahead == '*'){
match('*');factor();printf("*");
}else if( lookahead == '/'){
match('/');factor();printf("/");
}else return;
}
}
void expr(){
term();
while(1){
if(lookahead == '+'){
match('+');term();printf("+");
}else if(lookahead == '-'){
match('-');term();printf("-");
}
else return;
}
}
int main(){
lookahead = getchar();
expr();
printf("\n");
getchar();
return 0;
}