1. Overview and Scope
2. Introducing a simple process
3. BNF grammar for interpreter system
◉ BNF class method For Our team interpreter.
class parser{
public:
bool checkID(string); //
void program(string*, node*, int);
void declarations(string*, node*, int);
void compoundStatement(string*, node*, int);
void identifierList(string*, node*, int);
void type(string*, node*, int);
void standardType(string*, node*);
void num(string*, node*);
bool checkNum(string);
bool checkFloat(string);
void id(string, node*); //String array doesn't need to terminal node
void statementList(string*, node*,int);
void statement(string*, node*, int);
void variable(string*, node* , int);
void expression(string*, node*, int);
void printStatement(string*, node*, int);
void procedureStatement(string*, node*, int);
void simpleExpression(string*, node*, int);
void actualParameterExpression(string*, node*, int);
void expressionList(string*, node*, int);
void term(string*, node*, int);
void factor(string*, node*, int);
void relop(string, node*);
void sign(string, node*);
void multop(string, node*);

분야