C //练习 1-24 编写一个程序,查找C语言程序中的基本语法错误,如圆括号、方括号、花括号不配对等。

C程序设计语言 (第二版) 练习1-24

练习 1-24 编写一个程序,查找C语言程序中的基本语法错误,如圆括号、方括号、花括号不配对等。要正确处理引号(包括单引号和双引号)、转义字符序列与注释。

注意:代码在win32控制台运行,在不同的IDE环境下,有部分可能需要变更。
IDE工具:Visual Studio 2010

 

代码块:
#include <stdio.h>
#include <stdlib.h>

#define MAXLINE 1000

void inputCode(char s[], int lim){
	char c;
	int i;
	
	printf("Enter Code:\n");
	for(i = 0; i < lim - 1 && (c = getchar()) != EOF; i++){
		s[i] = c;
	}
	s[i] = '\0';
}

void checkCode(char s[]){
	int i, k;

	//设定圆括号初始值
	int leftParentheses = 0;
	int rightParentheses = 0;
	int parenthesesStatus;

	//设定方括号初始值
	int leftSquareBrackets = 0;
	int rightSquareBrackets = 0;
	int squareBracketsStatus;
	
	//设定花括号初始值
	int leftCurlyBraces = 0;
	int rightCurlyBraces = 0;
	int curlyBracesStatus;
	
	//设定双引号初始值
	int leftQuotes = 0;
	int rightQuotes = 0;
	int quotesStatus = 0;
	
	//设定单引号初始值
	int leftApostrophe = 0;
	int rightApostrophe = 0;
	int apostropheStatus = 0;

	//设定转义字符初始值
	int escapeCharStatus = 0;

	for(i = 0; s[i] != EOF; i++){
		if(s[i] == '/' && s[i+1] == '/' && quotesStatus == 0){
			for(k = i; s[k] != '\n'; k++);
			i = k;
			continue;
		}

		if(s[i] == '/' && s[i+1] == '*' && quotesStatus == 0){
			for(k = i; ; k++){
				if(s[k] == '*' && s[k+1] == '/'){
					break;
				}
			}
			i = k + 1;
			continue;
		}

		if(quotesStatus == 1 && s[i] == '\\'){
			if(s[i+1] == 'a' || s[i+1] == 'b' || s[i+1] == 'f' || s[i+1] == 'n' || s[i+1] == 'r' || s[i+1] == 't' || s[i+1] == 'v' || s[i+1] == '\\' || s[i+1] == '\'' || s[i+1] == '\"' || s[i+1] == '?' || s[i+1] == '0'){
				escapeCharStatus = 1;
				i++;
				continue;
			}
			if((s[i+1] == 'd' && s[i+2] == 'd' && s[i+3] == 'd') || (s[i+1] == 'x' && s[i+2] == 'h' && s[i+3] == 'h')){
				escapeCharStatus = 1;
				i += 2;
				continue;
			}
		}

		if(apostropheStatus == 1 && s[i] == '\\'){
			if(s[i+1] == 'a' || s[i+1] == 'b' || s[i+1] == 'f' || s[i+1] == 'n' || s[i+1] == 'r' || s[i+1] == 't' || s[i+1] == 'v' || s[i+1] == '\\' || s[i+1] == '\'' || s[i+1] == '\"' || s[i+1] == '?' || s[i+1] == '0'){
				escapeCharStatus = 1;
				i++;
				continue;
			}
		}

		if(apostropheStatus == 1 && escapeCharStatus == 1){
			escapeCharStatus = 0;
			continue;
		}

		if(quotesStatus == 1 && escapeCharStatus == 1){
			escapeCharStatus = 0;
			continue;
		}

		if(s[i] == '\"' && quotesStatus == 0 && escapeCharStatus == 0){
			quotesStatus = 1;
			leftQuotes++;
			continue;
		}

		if(s[i] == '\"' && quotesStatus == 1 && escapeCharStatus == 0){
			quotesStatus = 0;
			rightQuotes++;
			continue;
		}

		if(s[i] == '\'' && apostropheStatus == 0 && escapeCharStatus == 0){
			apostropheStatus = 1;
			leftApostrophe++;
			continue;
		}

		if(s[i] == '\'' && apostropheStatus == 1 && escapeCharStatus == 0){
			apostropheStatus = 0;
			rightApostrophe++;
			continue;
		}

		if(s[i] == '(' && quotesStatus == 0 && apostropheStatus == 0){
			parenthesesStatus = 1;
			leftParentheses++;
			continue;
		}

		if(s[i] == ')' && parenthesesStatus == 1){
			parenthesesStatus = 0;
			rightParentheses++;
			continue;
		}

		if(s[i] == '[' && quotesStatus == 0 && apostropheStatus == 0){
			squareBracketsStatus = 1;
			leftSquareBrackets++;
			continue;
		}
		
		if(s[i] == ']' && squareBracketsStatus == 1){
			squareBracketsStatus = 0;
			rightSquareBrackets++;
			continue;
		}

		if(s[i] == '{' && quotesStatus == 0 && apostropheStatus == 0){
			curlyBracesStatus = 1;
			leftCurlyBraces++;
			continue;
		}

		if(s[i] == '}' && curlyBracesStatus == 1){
			curlyBracesStatus = 0;
			rightCurlyBraces++;
			continue;
		}
	}

	if(leftParentheses != rightParentheses){
		printf("Parentheses don't Match!\n");
	}

	if(leftSquareBrackets != rightSquareBrackets){
		printf("Square Brackets don't Match!\n");
	}

	if(leftCurlyBraces != rightCurlyBraces){
		printf("Curly Braces don't Match!\n");
	}

	if(leftQuotes != rightQuotes){
		printf("Quotes don't Match!\n");
	}

	if(leftApostrophe != rightApostrophe){
		printf("Apostrophe don't Match!\n");
	}
		
}
		
int main(){
	char line[MAXLINE];

	inputCode(line, MAXLINE);
	checkCode(line);

	system("pause");
	return 0;
}
评论 4
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

Navigator_Z

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值