LR(1)表驱动语法分析程序

 /*
  * LR(1) 语法分析
  */
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

 #include "Common.h"
 #include "LRCal.h"
 #include "LRMigrate.h"
 #include "Stack.h"

 #define NEXTWORD(s) ((*(s)==0)?SYM_EOF:*((s)++))

 extern char *Grammer[];

 void LRParse(struct LRElement **LRTable, unsigned char *InputString)
 {
     printf("-------- Parse --------\n");
     struct Stack *SymbolStack = BuildStack();
     Push(SymbolStack, );                // push $;
     Push(SymbolStack, );                // push start state s0;
     int Word = NEXTWORD(InputString);    // word <- NextWord();
     int State = ;
     while (true)                        // while (true)
     {
         State = Top(SymbolStack);        // state <- top of stack;
         printf("State: %d\tWord: %c \t", State, Word);
         if (LRTable[State][Word].Action == Reduce)    // if (Action[state, word] = "reduce A->β")
         {
             printf("reduce %d", (int)LRTable[State][Word].ActionValue);

             char *Production = Grammer[LRTable[State][Word].ActionValue - ];
             int ProductSize = strlen(Production) - ;
             // pop 2*|β| symbols;
             ProductSize *= ;
             while (ProductSize--)
             {
                 Pop(SymbolStack);
             }
             // state <- top of stack;
             State = Top(SymbolStack);
             // push A;
             int LeftUnterminal = (int)Production[];
             Push(SymbolStack, LeftUnterminal);
             // push Goto[State, A];
             Push(SymbolStack, (int)LRTable[State][LeftUnterminal].ActionValue);
         }
         else if (LRTable[State][Word].Action == Shift)    // else if (Action[state, word] = "shift si")
         {
             printf("shift %d", (int)LRTable[State][Word].ActionValue);
             // push word;
             Push(SymbolStack, Word);
             // push si;
             Push(SymbolStack, LRTable[State][Word].ActionValue);
             // word <- NextWord();
             Word = NEXTWORD(InputString);
         }
         else if (LRTable[State][Word].Action == Accept)    // else if (Action[state, word] = "accept")
         {
             printf("accept\n");
             break;
         }
         else
         {
             printf("Syntax Error!\n");
             exit();
         }
         printf("\n");
     }
     printf("Grammer Parse Success!\n");
 }

联动：LR(1)表生成算法演示程序

全部代码文件：http://files.cnblogs.com/rexfield/LR.zip