85 lines
1.7 KiB
Plaintext
85 lines
1.7 KiB
Plaintext
%lexer
|
|
// recursive descent parser for Grammar 3.11
|
|
// completed from p.48 by Malcolm Crowe, June 1997
|
|
%{
|
|
|
|
using System.IO;
|
|
using Tools;
|
|
|
|
public class main
|
|
{
|
|
public static void Main(string[] args) {
|
|
new main().parse(args[0]); // we need an object
|
|
}
|
|
|
|
void parse(String s) {
|
|
lexer = new tokens();
|
|
lexer.Start(new StreamReader(s));
|
|
tok = getToken();
|
|
S();
|
|
if (tok!=EOF)
|
|
error("EOF");
|
|
Console.WriteLine("Success");
|
|
}
|
|
Lexer lexer;
|
|
int getToken() {
|
|
Token t= (Token)lexer.Next();
|
|
if (t==null)
|
|
return EOF;
|
|
return t.kind;
|
|
}
|
|
void error(string s) { throw new Exception(s); }
|
|
void error() { throw new Exception("Syntax error"); }
|
|
|
|
// this is basically the code on p.48:
|
|
|
|
public const int IF=1, THEN=2, ELSE=3, BEGIN=4, END=5,
|
|
PRINT=6, SEMI=7, NUM=8, EQ=9, EOF= -1;
|
|
|
|
int tok;
|
|
|
|
void advance() { tok=getToken(); }
|
|
|
|
void eat(int t) {
|
|
if (tok==t) advance();
|
|
else error();
|
|
}
|
|
|
|
void S() {
|
|
switch(tok) {
|
|
case IF: eat(IF); E(); eat(THEN); S();
|
|
eat(ELSE); S(); break;
|
|
case BEGIN: eat(BEGIN); S(); L(); break;
|
|
case PRINT: eat(PRINT); E(); break;
|
|
default: error();
|
|
}
|
|
}
|
|
|
|
void L() {
|
|
switch(tok) {
|
|
case END: eat(END); break;
|
|
case SEMI: eat(SEMI); S(); L(); break;
|
|
default: error();
|
|
}
|
|
}
|
|
|
|
void E() { eat(NUM); eat(EQ); eat(NUM); }
|
|
}
|
|
%}
|
|
%token Token {
|
|
public int kind;
|
|
}
|
|
|
|
[\ \r\n\t] ;
|
|
if %Token { kind = main.IF; }
|
|
then %Token { kind = main.THEN; }
|
|
else %Token { kind = main.ELSE; }
|
|
begin %Token { kind = main.BEGIN; }
|
|
end %Token { kind = main.END; }
|
|
print %Token { kind = main.PRINT; }
|
|
= %Token { kind = main.EQ; }
|
|
; %Token { kind = main.SEMI; }
|
|
[0-9]+ %Token { kind = main.NUM; }
|
|
[a-z]+ %Token { kind = main.NUM; }
|
|
|