bool peekCompare(params int[] values) { Token t = la; foreach(int i in values) { if(i != -1 && t.kind != i) { scanner.ResetPeek(); return false; } if (t.next == null) t = scanner.Peek(); else t = t.next; } scanner.ResetPeek(); return true; }
bool peekString(int count, params string[] values) { Token t = la; for(; count > 0; count --) t = scanner.Peek(); foreach(var it in values) { if(t.val == it) { scanner.ResetPeek(); return true; } } scanner.ResetPeek(); return false; }
public void Patch(SQF.ClassParser.ConfigField field, bool AutoRemove) { this.MainField = field; la = new Token(); la.val = ""; Get(); doRoot(); if(AutoRemove) ApplyRemovedFields(); }
void Get() { for (;;) { t = la; la = scanner.Scan(); if (la.kind <= maxT) { ++errDist; break; } la = t; } }
public RangeDescription GetRange(string key) { this.KeyToFind = key; this.Range = new RangeDescription(); this.MainField = new SQF.ClassParser.ConfigField(); this.MainField.ToClass(); la = new Token(); la.val = ""; Get(); doRoot(); return this.Range.IsFilled ? this.Range : null; }
public SQF.ClassParser.ConfigField Parse() { this.MainField = new SQF.ClassParser.ConfigField(); this.MainField.ToClass(); la = new Token(); la.val = ""; Get(); doRoot(); return this.MainField; }
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: if (ch >= '0' && ch <= '9') {AddCh(); goto case 2;} else {goto case 0;} case 2: recEnd = pos; recKind = 1; if (ch >= '0' && ch <= '9') {AddCh(); goto case 2;} else if (ch == '.') {AddCh(); goto case 3;} else {t.kind = 1; break;} case 3: if (ch >= '0' && ch <= '9') {AddCh(); goto case 4;} else {goto case 0;} case 4: recEnd = pos; recKind = 1; if (ch >= '0' && ch <= '9') {AddCh(); goto case 4;} else {t.kind = 1; break;} case 5: if (ch >= '0' && ch <= '9' || ch >= 'A' && ch <= 'F' || ch >= 'a' && ch <= 'f') {AddCh(); goto case 6;} else {goto case 0;} case 6: recEnd = pos; recKind = 2; if (ch >= '0' && ch <= '9' || ch >= 'A' && ch <= 'F' || ch >= 'a' && ch <= 'f') {AddCh(); goto case 6;} else {t.kind = 2; break;} case 7: if (ch <= 9 || ch >= 11 && ch <= 12 || ch >= 14 && ch <= '!' || ch >= '#' && ch <= 65535) {AddCh(); goto case 7;} else if (ch == '"') {AddCh(); goto case 11;} else {goto case 0;} case 8: recEnd = pos; recKind = 4; if (ch >= '0' && ch <= '9' || ch >= 'A' && ch <= 'Z' || ch == '_' || ch >= 'a' && ch <= 'z') {AddCh(); goto case 8;} else {t.kind = 4; break;} case 9: recEnd = pos; recKind = 5; if (ch >= '0' && ch <= '9' || ch >= 'A' && ch <= 'Z' || ch == '_' || ch >= 'a' && ch <= 'z') {AddCh(); goto case 9;} else {t.kind = 5; t.val = new String(tval, 0, tlen); CheckLiteral(); return t;} case 10: recEnd = pos; recKind = 1; if (ch >= '0' && ch <= '9') {AddCh(); goto case 2;} else if (ch == '.') {AddCh(); goto case 3;} else if (ch == 'X' || ch == 'x') {AddCh(); goto case 5;} else {t.kind = 1; break;} case 11: recEnd = pos; recKind = 3; if (ch == '"') {AddCh(); goto case 7;} else {t.kind = 3; break;} case 12: {t.kind = 7; break;} case 13: {t.kind = 8; break;} case 14: {t.kind = 9; break;} case 15: {t.kind = 10; break;} case 16: {t.kind = 11; break;} case 17: {t.kind = 12; break;} case 18: {t.kind = 13; break;} case 19: {t.kind = 16; 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; }