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

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

// Including external dependecies

#include "StdAfx.h"
#include "proba4.h"

// Terminals information for grammar automaton

ENUM_TOKENS proba4_Terms [] = {
TKN_a,
TKN_b,
TKN_1,
TKN_0
};

// Productions information for grammar automaton

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

// Goto table for grammar automaton

GInfo proba4_Goto [] = {
{ STATE_0, false, NT_SS, STATE_1 },
{ STATE_0, true, TKN_a, STATE_2 },
{ STATE_0, true, TKN_b, STATE_7 },
{ STATE_2, false, NT_AA, STATE_3 },
{ STATE_2, true, TKN_1, STATE_4 },
{ STATE_4, false, NT_AA, STATE_5 },
{ STATE_4, true, TKN_1, STATE_4 },
{ STATE_5, true, TKN_0, STATE_6 },
{ STATE_7, false, NT_BB, STATE_8 },
{ STATE_7, true, TKN_1, STATE_9 },
{ STATE_9, false, NT_BB, STATE_10 },
{ STATE_9, true, TKN_1, STATE_9 },
{ STATE_10, true, TKN_0, STATE_11 },
{ STATE_11, true, TKN_0, STATE_12 }
};

// Action table for grammar automaton

FInfo proba4_Action [] = {
{ STATE_0, TKN_a, -1 },
{ STATE_0, TKN_b, -1 },
{ STATE_1, TKN_EPS, -2 },
{ STATE_2, TKN_1, -1 },
{ STATE_2, TKN_EPS, 4 },
{ STATE_2, TKN_0, 4 },
{ STATE_3, TKN_EPS, 1 },
{ STATE_4, TKN_1, -1 },
{ STATE_4, TKN_EPS, 4 },
{ STATE_4, TKN_0, 4 },
{ STATE_5, TKN_0, -1 },
{ STATE_6, TKN_EPS, 3 },
{ STATE_6, TKN_0, 3 },
{ STATE_7, TKN_1, -1 },
{ STATE_7, TKN_EPS, 6 },
{ STATE_7, TKN_0, 6 },
{ STATE_8, TKN_EPS, 2 },
{ STATE_9, TKN_1, -1 },
{ STATE_9, TKN_EPS, 6 },
{ STATE_9, TKN_0, 6 },
{ STATE_10, TKN_0, -1 },
{ STATE_11, TKN_0, -1 },
{ STATE_12, TKN_EPS, 5 },
{ STATE_12, TKN_0, 5 }
};