private bool ExpectInt(Expression exp, Token t, bool isRightHandSide)
{
if (!(exp is TypedExpression<int>)) {
errors.SemErr(t.line, t.col, string.Format("'{0}' expects an integer expression on its {1} side", t.val, isRightHandSide ? "right" : "left"));
return false;
}
return true;
}
private void ExpectIntArg(Expression exp, Token t)
{
if (!(exp is TypedExpression<int>)) {
errors.SemErr(t.line, t.col, "Arguments to procedures can only be integer expressions");
}
}
void Init()
{
pos = -1; line = 1; col = 0;
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;
NextCh();
}
pt = tokens = new Token(); // first token is a dummy
}
public Call(string name, List<Expression> expressions, Token callToken, Token lastArgToken)
{
foreach (Expression ex in expressions) {
AddChild(ex);
}
_name = name;
_callToken = callToken;
_lastArgToken = lastArgToken;
}
// 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;
}
public void Parse()
{
la = new Token();
la.val = "";
Get();
Program();
Expect(0);
}
Token NextToken()
{
while (ch == ' ' ||
ch >= 9 && ch <= 10 || ch == 13
) NextCh();
if (ch == '#' && Comment0() ||ch == '/' && Comment1() ||ch == '/' && Comment2()) return NextToken();
t = new Token();
t.pos = pos; t.col = col; t.line = line;
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: { t.kind = noSym; break; } // NextCh already done
case 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 2;}
else {t.kind = 2; break;}
case 3:
{t.kind = 6; break;}
case 4:
{t.kind = 9; break;}
case 5:
{t.kind = 11; break;}
case 6:
{t.kind = 12; break;}
case 7:
if (ch == '=') {AddCh(); goto case 8;}
else {t.kind = noSym; break;}
case 8:
{t.kind = 17; break;}
case 9:
{t.kind = 31; break;}
case 10:
{t.kind = 32; break;}
case 11:
if (ch == '=') {AddCh(); goto case 12;}
else {t.kind = noSym; break;}
case 12:
{t.kind = 33; break;}
case 13:
if (ch == '=') {AddCh(); goto case 14;}
else {t.kind = noSym; break;}
case 14:
{t.kind = 34; break;}
case 15:
{t.kind = 35; break;}
case 16:
{t.kind = 36; break;}
case 17:
{t.kind = 37; break;}
case 18:
{t.kind = 38; break;}
case 19:
{t.kind = 39; break;}
case 20:
{t.kind = 40; break;}
case 21:
{t.kind = 41; break;}
case 22:
{t.kind = 42; break;}
case 23:
{t.kind = 43; break;}
case 24:
{t.kind = 44; break;}
case 25:
{t.kind = 45; break;}
case 26:
if (ch == '=') {AddCh(); goto case 9;}
else if (ch == '<') {AddCh(); goto case 18;}
else {t.kind = 29; break;}
case 27:
if (ch == '=') {AddCh(); goto case 10;}
else if (ch == '>') {AddCh(); goto case 19;}
else {t.kind = 30; break;}
}
t.val = new String(tval, 0, tlen);
return t;
}