利用栈检查程序中成对符号使用的正确性

算法思路：

       从第一个字符开始扫描，

       当遇到普通字符时忽略，当遇到左符号时压入栈中；

       当遇到右符号时从栈中弹出栈顶符号，并和右符号进行匹配：

             匹配成功：继续读入下一个字符

             匹配失败：立即停止，并报错

      结束：

              成功：所有字符扫描完毕，且栈为空

              失败：匹配失败或所有字符扫描完毕但栈非空

 

       这里有一点只要注意的是单引号和双引号的左右符号在C程序语言中是一样的，所以在判断时要区分好。我这里用的是全局变量的统计策略，统计双引号（单引号）出现的次数，单数次为左符号，偶数次为右符号。

#if 1
#include <stdio.h>
#include <stdlib.h>
#include "LinkStack.h"

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int isSingle = 1;   //统计单引号的个数
int isDouble = 1;   //统计双引号的个数

int isLeft(char c)
{
    int ret = 0;
    
    switch(c)
    {
        case '<':
        case '(':
        case '[':
        case '{':
            ret = 1;
            break;
        default:
            ret = 0;
            break;
    }

	if(c == '\'')
	{
		if( isSingle % 2 ) //单引号的个数为单数，说明是左符号
		{
			ret = 1;
			++isSingle;
		}
	}
	else if(c == '\"')
	{
		if( isDouble % 2 )
		{
			ret = 1;
			++isDouble;
		}	
	}


    
    return ret;
}

int isRight(char c)
{
    int ret = 0;
    
    switch(c)
    {
        case '>':
        case ')':
        case ']':
        case '}':
            ret = 1;
            break;
        default:
            ret = 0;
            break;
    }

	if(c == '\'')
	{
		if( isSingle % 2 == 0 ) //单引号的个数为偶数，说明是右符号
		{
			ret = 1;
			++isSingle;
		}	
	}
	else if(c == '\"')
	{
		if( isDouble % 2  == 0)
		{
			ret = 1;
			++isDouble;
		}	
	}

    
    return ret;
}

int match(char left, char right)
{
    int ret = 0;
    
    switch(left)
    {
        case '<':
            ret = (right == '>');
            break;
        case '(':
            ret = (right == ')');
            break;
        case '[':
            ret = (right == ']');
            break;
        case '{':
            ret = (right == '}');
            break;
        case '\'':
            ret = (right == '\'');
            break;
        case '\"':
            ret = (right == '\"');
            break;
        default:
            ret = 0;
            break;
    }
    
    return ret;
}

int scanner(const char* code)
{
    LinkStack* stack = LinkStack_Create();
    int ret = 0;
    int i = 0;
    
    while( code[i] != '\0' )
    {
        if( isLeft(code[i]) )
        {
            LinkStack_Push(stack, (void*)(code + i));
	    ++i;              //去判断下一个字符

        }


        if( code[i] != '\0' && isRight(code[i]) )
        {
            char* c = (char*)LinkStack_Pop(stack);
            
            if( (c == NULL) || !match(*c, code[i]) )
            {
                printf("%c does not match!\n", code[i]);
                ret = 0;
                break;
            }
        }
        
        i++;
    }
    
    if( (LinkStack_Size(stack) == 0) && (code[i] == '\0') )
    {
        printf("Succeed!\n");
        ret = 1;
    }
    else
    {
        printf("Invalid code!\n");
        ret = 0;
    }
    
    LinkStack_Destroy(stack);
    
    return ret;
}

int main(int argc, char *argv[])
{
	const char* code = "afggh}v[bd] f\"fg\"  {ddf}";
    
    scanner(code);

	printf("%d\n", 0%2);
    
	return 0;
}

#endif