栈的应用 - 符号匹配性检测

当我们用编译器编译工程的时候，时常会出现缺失大括号或者小括号等之类的情况。那么编译器是怎样实现符号匹配监测的呢？其实也是利用了栈的原理。

首先来看一下算法的整体思路：

1、从第一个字符开始扫描

2、当遇到左符号时进栈，当遇到普通字符忽略

3、当遇到右字符时，弹出栈顶的元素，并将右符号与弹出栈顶的符号进行匹配，如果匹配成功，则继续下一个字符；如果匹配失败，则停止程序并报错。

4、成功结束的标志是字符扫描完毕且栈为空，否则匹配失败。

实现符号匹配性检测的代码依然选择复用之前实现的动态栈代码。

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

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

int isRight(char c)
{
    int ret = 0;
    
    switch(c)
    {
        case '>':
        case ')':
        case ']':
        case '}':
        case '\'':
        case '\"':
            ret = 1;
        	break;
        default:
            ret = 0;
            break;
    }
    
    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' ) // The scan starts with the first character
	{
		if( isLeft(code[i]) ) // If it is the left character,push,otherwise ignore
		{
			LinkStack_Push(stack, (void*)(code + i)); 
		}

		if( isRight(code[i]) )
		{
			char* c = (char*)LinkStack_Pop(stack); 

			if( (c == NULL) || (!match(*c, code[i])) ) // If the match fails
			{
				printf("%c dose not match\n", code[i]);
				ret = 0;
				break;
			}
		}

		i++;
	}

	if( (LinkStack_Size(stack) == 0) && (code[i] == '\0') )
	{
		printf("match is success\n");
		ret = 1;
	}
	else
	{
		printf("match is error\n");
		ret = 0;
	}

	LinkStack_Destroy(stack);

	return ret;
}

int main(int argc, char *argv[])
{
	const char* code = "(match*c, codei])"; 

	scanner(code);

	return 0;
}