Example #1
0
 public void Parse()
 {
     la = new Token();
     la.val = "";
     Get();
     SMG();
     Expect(0);
 }
Example #2
0
        void Get()
        {
            for (;;) {
            t = la;
            la = scanner.Scan();
            if (la.kind <= maxT) { ++errDist; break; }

            la = t;
            }
        }
Example #3
0
        Token NextToken()
        {
            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') {AddCh(); goto case 1;}
                else {t.kind = 1; t.val = new String(tval, 0, tlen); CheckLiteral(); return t;}
            case 2:
                recEnd = pos; recKind = 2;
                if (ch >= '0' && ch <= '9') {AddCh(); goto case 2;}
                else {t.kind = 2; t.val = new String(tval, 0, tlen); CheckLiteral(); return t;}
            case 3:
                if (ch == '"') {AddCh(); goto case 4;}
                else if (ch <= '!' || ch >= '#' && ch <= 65535) {AddCh(); goto case 3;}
                else {goto case 0;}
            case 4:
                {t.kind = 3; break;}
            case 5:
                {t.kind = 10; break;}
            case 6:
                {t.kind = 14; break;}
            case 7:
                if (ch == '>') {AddCh(); goto case 8;}
                else {goto case 0;}
            case 8:
                {t.kind = 27; break;}
            case 9:
                {t.kind = 29; break;}
            case 10:
                {t.kind = 30; break;}
            case 11:
                {t.kind = 31; break;}
            case 12:
                {t.kind = 34; break;}
            case 13:
                recEnd = pos; recKind = 1;
                if (ch >= '0' && ch <= '9' || ch >= 'a' && ch <= 'z') {AddCh(); goto case 1;}
                else if (ch == '#') {AddCh(); goto case 5;}
                else {t.kind = 1; t.val = new String(tval, 0, tlen); CheckLiteral(); return t;}

            }
            t.val = new String(tval, 0, tlen);
            return t;
        }
Example #4
0
 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
 }
Example #5
0
 // 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;
     }
 }
Example #6
0
 // make sure that peeking starts at the current scan position
 public void ResetPeek()
 {
     pt = tokens;
 }
Example #7
0
        // 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;
        }