Курсовая работа2 / SLR_Grammar / proba3

// File generated by SLR(1)-Grammer for grammar proba3

// Including external dependecies

#include "StdAfx.h"
#include "proba3.h"

// Terminals information for grammar automaton

ENUM_TOKENS proba3_Terms [] = {
TKN_e,
TKN_b,
TKN_d,
TKN_;,
TKN_a
};

// Productions information for grammar automaton

RuleInfo proba3_Rules [] = {
{ START, 1 },
{ NT_SS, 4 },
{ NT_AA, 3 },
{ NT_BB, 3 },
{ NT_BB, 1 },
{ NT_CC, 1 },
{ NT_CC, 0 },
{ NT_AA, 0 }
};

// Goto table for grammar automaton

GInfo proba3_Goto [] = {
{ STATE_0, false, NT_SS, STATE_1 },
{ STATE_0, true, TKN_b, STATE_2 },
{ STATE_2, false, NT_AA, STATE_3 },
{ STATE_3, false, NT_BB, STATE_4 },
{ STATE_3, false, NT_CC, STATE_9 },
{ STATE_3, true, TKN_d, STATE_10 },
{ STATE_3, true, TKN_a, STATE_8 },
{ STATE_4, true, TKN_e, STATE_5 },
{ STATE_4, true, TKN_;, STATE_6 },
{ STATE_6, false, NT_CC, STATE_7 },
{ STATE_6, true, TKN_a, STATE_8 },
{ STATE_10, true, TKN_;, STATE_11 }
};

// Action table for grammar automaton

FInfo proba3_Action [] = {
{ STATE_0, TKN_b, -1 },
{ STATE_1, TKN_EPS, -2 },
{ STATE_2, TKN_e, 7 },
{ STATE_2, TKN_d, 7 },
{ STATE_2, TKN_;, 7 },
{ STATE_2, TKN_a, 7 },
{ STATE_3, TKN_d, -1 },
{ STATE_3, TKN_a, -1 },
{ STATE_3, TKN_e, 6 },
{ STATE_3, TKN_;, 6 },
{ STATE_4, TKN_e, -1 },
{ STATE_4, TKN_;, -1 },
{ STATE_5, TKN_EPS, 1 },
{ STATE_6, TKN_a, -1 },
{ STATE_6, TKN_e, 6 },
{ STATE_6, TKN_;, 6 },
{ STATE_7, TKN_e, 3 },
{ STATE_7, TKN_;, 3 },
{ STATE_8, TKN_e, 5 },
{ STATE_8, TKN_;, 5 },
{ STATE_9, TKN_e, 4 },
{ STATE_9, TKN_;, 4 },
{ STATE_10, TKN_;, -1 },
{ STATE_11, TKN_e, 2 },
{ STATE_11, TKN_d, 2 },
{ STATE_11, TKN_;, 2 },
{ STATE_11, TKN_a, 2 }
};