public override void Parse()
{
la = new Token();
la.val = "";
Get();
DSImperative();
Expect(0);
}
void Get()
{
for (;;) {
t = la;
la = scanner.Scan();
if (la.kind <= maxT) { ++errDist; break; }
la = t;
}
}
Token NextToken()
{
int nestingLevel = 0;
while (ch == ' ' ||
ch >= 9 && ch <= 10 || ch == 13
) NextCh();
if (ch == '/' && Comment0() ||ch == '/' && Comment1()) return NextToken();
int recKind = noSym;
int recEnd = pos;
t = new Token();
t.pos = pos; t.col = col; t.line = line; t.charPos = charPos;
int state;
if (start.ContainsKey(ch)) { state = (int) start[ch]; }
else { state = 0; }
tlen = 0; AddCh();
switch (state) {
case -1: { t.kind = eofSym; break; } // NextCh already done
case 0: {
if (recKind != noSym) {
tlen = recEnd - t.pos;
SetScannerBehindT();
}
t.kind = recKind; break;
} // NextCh already done
case 1:
recEnd = pos; recKind = 1;
if (ch >= '0' && ch <= '9' || ch >= 'A' && ch <= 'Z' || ch == '_' || ch >= 'a' && ch <= 'z') {AddCh(); goto case 1;}
else {t.kind = 1; t.val = new String(tval, 0, tlen); CheckLiteral(); return t;}
case 2:
if (ch >= '0' && ch <= '9') {AddCh(); goto case 3;}
else {goto case 0;}
case 3:
recEnd = pos; recKind = 3;
if (ch >= '0' && ch <= '9') {AddCh(); goto case 3;}
else if (ch == 'E' || ch == 'e') {AddCh(); goto case 4;}
else {t.kind = 3; break;}
case 4:
if (ch >= '0' && ch <= '9') {AddCh(); goto case 6;}
else if (ch == '+' || ch == '-') {AddCh(); goto case 5;}
else {goto case 0;}
case 5:
if (ch >= '0' && ch <= '9') {AddCh(); goto case 6;}
else {goto case 0;}
case 6:
recEnd = pos; recKind = 3;
if (ch >= '0' && ch <= '9') {AddCh(); goto case 6;}
else {t.kind = 3; break;}
case 7:
if (ch <= '!' || ch >= '#' && ch <= 65535) {AddCh(); goto case 7;}
else if (ch == '"') {AddCh(); goto case 8;}
else {goto case 0;}
case 8:
{t.kind = 4; break;}
case 9:
if (ch <= '&' || ch >= '(' && ch <= 65535) {AddCh(); goto case 9;}
else if (ch == 39) {AddCh(); goto case 10;}
else {goto case 0;}
case 10:
{t.kind = 5; break;}
case 11:
{t.kind = 6; break;}
case 12:
{t.kind = 7; break;}
case 13:
{t.kind = 8; break;}
case 14:
{t.kind = 9; break;}
case 15:
{t.kind = 12; break;}
case 16:
{t.kind = 13; break;}
case 17:
{t.kind = 14; break;}
case 18:
{t.kind = 15; break;}
case 19:
{t.kind = 16; break;}
case 20:
{t.kind = 17; break;}
case 21:
if (ch == '<') { AddCh(); goto case 24; }
if (ch <= '"' || ch >= '$' && ch <= 65535) { AddCh(); goto case 21; }
else if (ch == '#') { AddCh(); goto case 25; }
else { goto case 0; }
case 22:
recEnd = pos; recKind = 2;
if (ch >= '0' && ch <= '9') {AddCh(); goto case 22;}
else if (ch == '.') {AddCh(); goto case 2;}
else {t.kind = 2; break;}
case 23:
recEnd = pos; recKind = 10;
if (ch == '=') {AddCh(); goto case 15;}
else {t.kind = 10; break;}
case 24:
recEnd = pos; recKind = 11;
if (ch == '=') { AddCh(); goto case 16; }
else if (ch == '#') { AddCh(); nestingLevel++; goto case 21; }
else { if (nestingLevel == 0) { goto case 0; } else { goto case 21; } }
case 25:
if (ch <= '"' || ch >= '$' && ch <= '=' || ch >= '?' && ch <= 65535) {AddCh(); goto case 21;}
else if (ch == '#') {AddCh(); goto case 25;}
else if (ch == '>') {AddCh(); goto case 26;}
else {goto case 0;}
case 26:
recEnd = pos; recKind = 26;
nestingLevel--;
if (nestingLevel == 0) { goto case 0; }
if (ch <= '"' || ch >= '$' && ch <= 65535) { AddCh(); goto case 21; }
else if (ch == '#') { AddCh(); goto case 25; }
else { t.kind = 26; break; }
case 27:
{t.kind = 30; break;}
case 28:
{t.kind = 32; break;}
case 29:
{t.kind = 33; break;}
case 30:
{t.kind = 35; break;}
case 31:
{t.kind = 36; break;}
case 32:
{t.kind = 38; break;}
case 33:
{t.kind = 39; break;}
case 34:
{t.kind = 40; break;}
case 35:
{t.kind = 43; break;}
case 36:
{t.kind = 44; break;}
case 37:
{t.kind = 45; break;}
case 38:
{t.kind = 46; break;}
case 39:
{t.kind = 48; break;}
case 40:
{t.kind = 49; break;}
case 41:
recEnd = pos; recKind = 31;
if (ch == '=') {AddCh(); goto case 17;}
else {t.kind = 31; break;}
case 42:
recEnd = pos; recKind = 47;
if (ch == '=') {AddCh(); goto case 18;}
else {t.kind = 47; break;}
case 43:
recEnd = pos; recKind = 37;
if (ch == '.') {AddCh(); goto case 20;}
else {t.kind = 37; break;}
case 44:
recEnd = pos; recKind = 41;
if (ch == '&') {AddCh(); goto case 36;}
else {t.kind = 41; break;}
case 45:
recEnd = pos; recKind = 42;
if (ch == '|') {AddCh(); goto case 37;}
else {t.kind = 42; break;}
}
t.val = new String(tval, 0, tlen);
return t;
}
void Init()
{
pos = -1; line = 1; col = 0; charPos = -1;
oldEols = 0;
NextCh();
if (ch == 0xEF) { // check optional byte order mark for UTF-8
NextCh(); int ch1 = ch;
NextCh(); int ch2 = ch;
if (ch1 != 0xBB || ch2 != 0xBF) {
throw new FatalError(String.Format("illegal byte order mark: EF {0,2:X} {1,2:X}", ch1, ch2));
}
buffer = new UTF8Buffer(buffer); col = 0; charPos = -1;
NextCh();
}
pt = tokens = new Token(); // first token is a dummy
}
// get the next token (possibly a token already seen during peeking)
public Token Scan()
{
if (tokens.next == null) {
return NextToken();
} else {
pt = tokens = tokens.next;
return tokens;
}
}
// make sure that peeking starts at the current scan position
public void ResetPeek()
{
pt = tokens;
}
// peek for the next token, ignore pragmas
public Token Peek()
{
do {
if (pt.next == null) {
pt.next = NextToken();
}
pt = pt.next;
} while (pt.kind > maxT); // skip pragmas
return pt;
}