****************************************************/
int right (char a)
{
int ret = 0;
switch(a)
{
case '>':
case ')':
case ']':
case '}':
case '\'':
case '\"':
ret = 1;
break;
default:
ret = 0;
break;
}
return ret;
}
/*******************************************************************************
*函数名：right
*参数：char a 传进来的数组元素
*返回值：int类型 如果是右侧符号，那么返回1，不是返回0
*功能：判断传进来的字符是否是右侧字符
*******************************************************************************/
int match(char bijiao, char a)
{
int ret = 0;
int i = 0;
switch(bijiao)
{
case '<':
ret = (a == '>');
break;
case '(':
ret = (a == ')');
break;
case '[':
ret = (a == ']');
break;
case '{':
ret = (a == '}');
break;
case '\'':
ret = (a == '\'');
break;
case '\"':
ret = (a == '\"');
break;
default:
ret = 0;
break;
}
return ret;
}
/*******************************************************************************
*函数名：scan
*参数：char *a 传进来的字符数组元素的地址
*返回值：int类型 如果是右侧符号，那么返回1，不是返回0
*功能：符号匹配算法的主要实现部分
*******************************************************************************/
int scan (char *a)
{
LinkStack * stack = LinkStack_Create();
int i = 0;
int ret = 0;
while (a[i] != '\0')
{
if (left(a[i]) == 1)
{
LinkStack_Push(stack, (void*)(a + i));
}
if (right(a[i]) == 1)
{
char* bijiao = (char*)LinkStack_Pop(stack);
if ((bijiao == NULL) || !match(*bijiao, a[i]))
{
printf ("%c\n", a[i]);
ret = 0;
break;
}
}
i++;
}
if (LinkStack_Top(stack) == NULL && a[i] == '\0')
{
printf ("编译成功\n");
}
else
{
printf ("出现错误\n");
}
LinkStack_Destroy(stack);
return ret;
}
int main()
{
char *a = "#include #include int main () { int a[5][5]; int(*p)[5]; p = a[0]; printf (\"%d\", &a[3][3] - &p[3][3]); } ";
scan(a);
return 0;
}