test0::dGotoEntry dAssemblerParcer::FindGoto (const int* const gotoList, int count, dToken token) const
{
int i0 = 0;
int i1 = count - 1;
while ((i1 - i0) >= 4) {
int i = (i1 + i0 + 1)>>1;
dGotoEntry action (gotoList[i]);
if (token <= dToken(action.m_token)) {
i1 = i;
} else {
i0 = i;
}
}
for (int i = i0; i <= i1; i ++) {
dGotoEntry action (gotoList[i]);
if (token == dToken(action.m_token)) {
return action;
}
}
return dGotoEntry(unsigned (-1));
}
bool test6::Parse(xxxx& scanner)
{
static short gotoCount[] = {
2, 1, 0, 0, 0};
static short gotoStart[] = {
0, 2, 3, 3, 3};
static dGotoEntry gotoTable[] = {
dGotoEntry (257, 2), dGotoEntry (258, 1), dGotoEntry (259, 3)};
dList<dStackPair> stack;
const int lastToken = 257;
stack.Append ();
m_grammarError = false;
dToken token = dToken (scanner.NextToken());
for (bool terminate = false; !terminate;) {
const dActionEntry* const action = GetNextAction (stack, token, scanner);
if (!action) {
terminate = true;
fprintf (stderr, "unrecoverable parser error\n");
DTRACE (("unrecoverable parser error\n"));
} else {
switch (action->m_stateType)
{
case dSHIFT:
{
dStackPair& entry = stack.Append()->GetInfo();
entry.m_state = action->m_nextState;
entry.m_scannerLine = scanner.GetLineNumber();
entry.m_scannerIndex = scanner.GetIndex();
entry.m_value = dUserVariable (token, scanner.GetTokenString(), entry.m_scannerLine, entry.m_scannerIndex);
token = dToken (scanner.NextToken());
entry.m_token = token;
if (token == -1) {
token = ACCEPTING_TOKEN;
}
break;
}
case dREDUCE:
{
dStackPair parameter[MAX_USER_PARAM];
int reduceCount = action->m_ruleSymbols;
_ASSERTE (reduceCount < sizeof (parameter) / sizeof (parameter[0]));
for (int i = 0; i < reduceCount; i ++) {
parameter[reduceCount - i - 1] = stack.GetLast()->GetInfo();
stack.Remove (stack.GetLast());
}
const dStackPair& stackTop = stack.GetLast()->GetInfo();
int start = gotoStart[stackTop.m_state];
int count = gotoCount[stackTop.m_state];
const dGotoEntry* const table = &gotoTable[start];
const dGotoEntry* const gotoEntry = FindGoto (table, count, dToken (action->m_nextState + lastToken));
dStackPair& entry = stack.Append()->GetInfo();
entry.m_state = gotoEntry->m_nextState;
entry.m_scannerLine = scanner.GetLineNumber();
entry.m_scannerIndex = scanner.GetIndex();
entry.m_token = dToken (gotoEntry->m_token);
switch (action->m_ruleIndex)
{
//do user semantic Actions
case 3:// rule0 :
{/*xxx1*/}
break;
case 1:// NewtonHeader :
{/*xxx0*/}
break;
case 4:// rule1 :
{/*xxx2*/}
break;
default:;
}
break;
}
case dACCEPT: // 2 = accept
{
// program parsed successfully, exit with successful code
terminate = true;
break;
}
default:
{
_ASSERTE (0);
// syntax error parsing program
//if (!ErrorHandler ("error")) {
//}
terminate = true;
m_grammarError = true;
break;
}
}
}
}
return !m_grammarError;
}
bool test4::Parce(lextest1& scanner)
{
dList<dStackPair> stack;
static short actionsCount[] = {2, 1, 2, 1, 1, 2, 2, 2, 1, 2};
static short actionsStart[] = {0, 2, 0, 3, 4, 5, 7, 0, 9, 5};
static dActionEntry actionTable[] = {
dActionEntry (259, 0, 1, 0, 0), dActionEntry (256, 0, 2, 0, 0),
dActionEntry (0, 1, 0, 1, 3),
dActionEntry (0, 2, 0, 0, 0),
dActionEntry (257, 0, 5, 0, 0),
dActionEntry (259, 0, 6, 0, 0), dActionEntry (256, 0, 7, 0, 0),
dActionEntry (0, 1, 0, 1, 3), dActionEntry (258, 1, 0, 1, 3),
dActionEntry (257, 0, 9, 0, 0),
};
static short gotoCount[] = {1, 0, 1, 0, 0, 1, 0, 1, 0, 1};
static short gotoStart[] = {0, 1, 1, 2, 2, 2, 3, 3, 4, 4};
static dGotoEntry gotoTable[] = {
dGotoEntry (261, 3), dGotoEntry (261, 4), dGotoEntry (261, 4), dGotoEntry (261, 8),
dGotoEntry (261, 8)};
const int lastToken = 261;
stack.Append ();
dToken token = dToken (scanner.NextToken());
for (;;) {
const dStackPair& stackTop = stack.GetLast()->GetInfo();
int start = actionsStart[stackTop.m_state];
int count = actionsCount[stackTop.m_state];
const dActionEntry* const action (FindAction (&actionTable[start], count, token));
_ASSERTE (action);
switch (action->m_stateType)
{
case dSHIFT:
{
dStackPair& entry = stack.Append()->GetInfo();
entry.m_token = dToken (action->m_token);
entry.m_state = action->m_nextState;
entry.m_value = dStackPair::dUserVariable (entry.m_token, scanner.GetTokenString());
token = dToken (scanner.NextToken());
if (token == -1) {
token = dToken (0);
}
break;
}
case dREDUCE:
{
dStackPair parameter[MAX_USER_PARAM];
int reduceCount = action->m_ruleSymbols;
_ASSERTE (reduceCount < sizeof (parameter) / sizeof (parameter[0]));
for (int i = 0; i < reduceCount; i ++) {
parameter[reduceCount - i - 1] = stack.GetLast()->GetInfo();
stack.Remove (stack.GetLast());
}
const dStackPair& stackTop = stack.GetLast()->GetInfo();
int start = gotoStart[stackTop.m_state];
int count = gotoCount[stackTop.m_state];
const dGotoEntry* const gotoEntry = FindGoto (&gotoTable[start], count, dToken (action->m_nextState + lastToken));
dStackPair& entry = stack.Append()->GetInfo();
entry.m_state = gotoEntry->m_nextState;
entry.m_token = dToken (gotoEntry->m_token);
switch (action->m_ruleIndex)
{
//do user semantic Actions
case 3:// rule stmt : a
{}
break;
default:;
}
break;
}
case dACCEPT: // 2 = accept
{
// program parced successfully, exit with successful code
return true;
}
default:
{
_ASSERTE (0);
// syntact error parciing program
//if (!ErrorHandler ("error")) {
//}
break;
}
}
}
return false;
}
