int dAssemblerLexical::NextToken ()
{
static short transitionsCount[] = {
2, 0, 0};
static short transitionsStart[] = {
0, 2, 2};
static short nextStateSet[] = {
1, 2};
static char nextCharacterSet[] = {
46, 93};
m_startIndex = m_index;
int state = 0;
int zeroCount = 2;
char ch = NextChar();
do {
int transCount = transitionsCount[state];
int tranStart = transitionsStart[state];
int nextStateIndex = GetNextStateIndex (ch, transCount, &nextCharacterSet[tranStart]);
if (nextStateIndex >= 0) {
ch = NextChar();
short* const stateArray = &nextStateSet[tranStart];
state = stateArray[nextStateIndex];
} else {
UnGetChar ();
switch (state)
{
case 1:
{
GetLexString ();
{return '.';}
state = 0;
ch = NextChar();
break;
}
case 2:
{
GetLexString ();
{return ']';}
state = 0;
ch = NextChar();
break;
}
default:
{
// Lexical error
return -1;
}
}
}
if (!ch) {
zeroCount--;
}
} while (zeroCount);
// Unknown pattern
return -1;
}
void dAssemblerLexical::ReadBalancedExpresion (char open, char close)
{
int count = 1;
while (count) {
int ch = NextChar();
if (ch == '\n') {
m_lineNumber ++;
}
if(ch == open) {
count ++;
} else if (ch == close) {
count --;
} else {
if (ch == '\'') {
ch = NextChar();
if (ch == '\\') {
ch = NextChar();
}
ch = NextChar();
} else if (ch == '\"') {
for (ch = NextChar(); ch != '\"'; ch = NextChar()) {
if (ch == '\\') {
ch = NextChar();
}
}
}
}
}
string tmp (m_tokenString);
GetLexString();
m_tokenString = tmp + m_tokenString;
}
int dParserLexical::NextToken ()
{
static short transitionsCount[] = {
74, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 126, 126, 10, 0, 0, 63, 63, 0, 0, 2,
127, 127, 127, 127, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 9, 127, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
static short transitionsStart[] = {
0, 74, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78,
78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 204, 78, 78, 214, 214, 78, 78, 277,
279, 406, 279, 279, 533, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628,
629, 630, 631, 632, 633, 634, 635, 636, 645, 772, 645, 645, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910,
911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925};
static short nextStateSet[] = {
1, 1, 1, 1, 79, 52, 47, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 41, 42, 44, 44, 44, 44, 44,
44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44,
44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44,
45, 46, 1, 1, 1, 1, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 43, 43,
43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 48, 39, 51, 51, 51, 51, 51, 51, 51, 51, 51,
51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
51, 51, 51, 51, 51, 51, 51, 51, 49, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 37, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 78, 77, 76, 75, 74, 73, 72, 71, 70, 69, 68, 67, 66, 65, 64, 63, 62, 61, 61,
61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
60, 59, 58, 57, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
61, 61, 61, 61, 61, 61, 56, 55, 54, 53, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23,
22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 2, 106, 103, 100, 96, 92, 88, 84, 80, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 81, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
82, 82, 82, 82, 82, 82, 82, 82, 10, 82, 82, 85, 86, 87, 9, 89, 90, 91, 8, 93, 94, 95, 7, 97,
98, 99, 6, 101, 102, 5, 104, 105, 4, 107, 108, 109, 110, 3};
static char nextCharacterSet[] = {
9, 10, 13, 32, 37, 39, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 65, 66, 67, 68, 69,
70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 95, 97, 98,
99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122,
123, 124, 9, 10, 13, 32, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19,
20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67,
68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91,
92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115,
116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 48, 49,
50, 51, 52, 53, 54, 55, 56, 57, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80,
81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 95, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109,
110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 42, 47, 1, 2, 3, 4, 5, 6, 7, 8, 9,
10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57,
58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81,
82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105,
106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 1, 2,
3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98,
99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122,
123, 124, 125, 126, 127, 33, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 58, 59, 60, 61, 62, 63, 65, 66,
67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90,
91, 92, 93, 94, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39,
39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 37, 101, 108, 112, 114, 115, 116, 117, 123, 1, 2, 3,
4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27,
28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51,
52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75,
76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123,
124, 125, 126, 127, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68,
69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92,
93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 110, 105, 111, 110, 111, 107, 101, 110, 116, 97, 114, 116, 105,
103, 104, 116, 114, 101, 99, 101, 102, 116, 120, 112, 101, 99, 116};
m_startIndex = m_index;
int state = 0;
int zeroCount = 2;
char ch = NextChar();
do {
int transCount = transitionsCount[state];
int tranStart = transitionsStart[state];
int nextStateIndex = GetNextStateIndex (ch, transCount, &nextCharacterSet[tranStart]);
if (nextStateIndex >= 0) {
ch = NextChar();
short* const stateArray = &nextStateSet[tranStart];
state = stateArray[nextStateIndex];
} else {
UnGetChar ();
switch (state)
{
case 1:
{
GetLexString ();
{}
state = 0;
ch = NextChar();
break;
}
case 2:
{
GetLexString ();
{ return dParserCompiler::GRAMMAR_SEGMENT;}
state = 0;
ch = NextChar();
break;
}
case 3:
{
GetLexString ();
{ return dParserCompiler::EXPECT;}
state = 0;
ch = NextChar();
break;
}
case 4:
{
GetLexString ();
{ return dParserCompiler::LEFT;}
state = 0;
ch = NextChar();
break;
}
case 5:
{
GetLexString ();
{ return dParserCompiler::PREC;}
state = 0;
ch = NextChar();
break;
}
case 6:
{
GetLexString ();
{ return dParserCompiler::RIGHT;}
state = 0;
ch = NextChar();
break;
}
case 7:
{
GetLexString ();
{ return dParserCompiler::START;}
state = 0;
ch = NextChar();
break;
}
case 8:
{
GetLexString ();
{ return dParserCompiler::TOKEN;}
state = 0;
ch = NextChar();
break;
}
case 9:
{
GetLexString ();
{ return dParserCompiler::UNION;}
state = 0;
ch = NextChar();
break;
}
case 10:
{
GetLexString ();
{ m_tokenString.Replace(0, 2, ""); m_tokenString.Replace(m_tokenString.Size() - 2, 2, ""); return dParserCompiler::CODE_BLOCK;}
state = 0;
ch = NextChar();
break;
}
case 11:
{
GetLexString ();
{ m_tokenString = "!"; return('!'); }
state = 0;
ch = NextChar();
break;
}
case 12:
{
GetLexString ();
{ m_tokenString = "%"; return('%'); }
state = 0;
ch = NextChar();
break;
}
case 13:
{
GetLexString ();
{ m_tokenString = "&"; return('&'); }
state = 0;
ch = NextChar();
break;
}
case 14:
{
GetLexString ();
{ m_tokenString = "("; return('('); }
state = 0;
ch = NextChar();
break;
}
case 15:
{
GetLexString ();
{ m_tokenString = ")"; return(')'); }
state = 0;
ch = NextChar();
break;
}
case 16:
{
GetLexString ();
{ m_tokenString = "*"; return('*'); }
state = 0;
ch = NextChar();
break;
}
case 17:
{
GetLexString ();
{ m_tokenString = "+"; return('+'); }
state = 0;
ch = NextChar();
break;
}
case 18:
{
GetLexString ();
{ m_tokenString = ","; return(','); }
state = 0;
ch = NextChar();
break;
}
case 19:
{
GetLexString ();
{ m_tokenString = "-"; return('-'); }
state = 0;
ch = NextChar();
break;
}
case 20:
{
GetLexString ();
{ m_tokenString = "."; return('.'); }
state = 0;
ch = NextChar();
break;
}
case 21:
{
GetLexString ();
{ m_tokenString = "/"; return('/'); }
state = 0;
ch = NextChar();
break;
}
case 22:
{
GetLexString ();
{ m_tokenString = ":"; return(':'); }
state = 0;
ch = NextChar();
break;
}
case 23:
{
GetLexString ();
{ m_tokenString = ";"; return(';'); }
state = 0;
ch = NextChar();
break;
}
case 24:
{
GetLexString ();
{ m_tokenString = "<"; return('<'); }
state = 0;
ch = NextChar();
break;
}
case 25:
{
GetLexString ();
{ m_tokenString = "="; return('='); }
state = 0;
ch = NextChar();
break;
}
case 26:
{
GetLexString ();
{ m_tokenString = ">"; return('>'); }
state = 0;
ch = NextChar();
break;
}
case 27:
{
GetLexString ();
{ m_tokenString = "?"; return('?'); }
state = 0;
ch = NextChar();
break;
}
case 28:
{
GetLexString ();
{ m_tokenString = m_tokenString.SubString (1, 1); return(m_tokenString[0]); }
state = 0;
ch = NextChar();
break;
}
case 29:
{
GetLexString ();
{ m_tokenString = "["; return('['); }
state = 0;
ch = NextChar();
break;
}
case 30:
{
GetLexString ();
{ m_tokenString = "\\"; return('\\'); }
state = 0;
ch = NextChar();
break;
}
case 31:
{
GetLexString ();
{ m_tokenString = "]"; return(']'); }
state = 0;
ch = NextChar();
break;
}
case 32:
{
GetLexString ();
{ m_tokenString = "^"; return('^'); }
state = 0;
ch = NextChar();
break;
}
case 33:
{
GetLexString ();
{ m_tokenString = "{"; return('{'); }
state = 0;
ch = NextChar();
break;
}
case 34:
{
GetLexString ();
{ m_tokenString = "|"; return('|'); }
state = 0;
ch = NextChar();
break;
}
case 35:
{
GetLexString ();
{ m_tokenString = "}"; return('}'); }
state = 0;
ch = NextChar();
break;
}
case 36:
{
GetLexString ();
{ m_tokenString = "~"; return('~'); }
state = 0;
ch = NextChar();
break;
}
case 37:
{
GetLexString ();
{}
state = 0;
ch = NextChar();
break;
}
case 38:
{
GetLexString ();
{}
state = 0;
ch = NextChar();
break;
}
case 39:
{
GetLexString ();
{}
state = 0;
ch = NextChar();
break;
}
case 40:
{
GetLexString ();
{ return dParserCompiler::INTEGER;}
state = 0;
ch = NextChar();
break;
}
case 41:
{
GetLexString ();
{ return(dParserCompiler::COLOM); }
state = 0;
ch = NextChar();
break;
}
case 42:
{
GetLexString ();
{ return(dParserCompiler::SIMICOLOM); }
state = 0;
ch = NextChar();
break;
}
case 43:
{
GetLexString ();
{ return dParserCompiler::LITERAL;}
state = 0;
ch = NextChar();
break;
}
case 44:
{
GetLexString ();
{ return dParserCompiler::LITERAL;}
state = 0;
ch = NextChar();
break;
}
case 45:
{
GetLexString ();
{ ReadBalancedExpresion ('{', '}'); return dParserCompiler::SEMANTIC_ACTION;}
state = 0;
ch = NextChar();
break;
}
case 46:
{
GetLexString ();
{ return(dParserCompiler::OR); }
state = 0;
ch = NextChar();
break;
}
default:
{
// Lexical error
return -1;
}
}
}
if (!ch) {
zeroCount--;
}
} while (zeroCount);
// Unknown pattern
return -1;
}
