finish lab1

Author: WindowsXp-Beta

.info

@@ -0,0 +1,2 @@
+STUDENT_NAME=Xinpeng Wei
+STUDENT_ID=519021910888

src/straightline/slp.cc

@@ -5,28 +5,125 @@
 namespace A {
 int A::CompoundStm::MaxArgs() const {
   // TODO: put your code here (lab1).
+  int args1 = stm1->MaxArgs();
+  int args2 = stm2->MaxArgs();
+  return args1 > args2 ? args1 : args2;
 }
 
 Table *A::CompoundStm::Interp(Table *t) const {
   // TODO: put your code here (lab1).
+  return stm2 -> Interp(stm1 -> Interp(t));
 }
 
 int A::AssignStm::MaxArgs() const {
   // TODO: put your code here (lab1).
+  return exp->MaxArgs();
 }
 
 Table *A::AssignStm::Interp(Table *t) const {
   // TODO: put your code here (lab1).
+  IntAndTable *tmp = exp -> Interp(t);
+  t = tmp -> t;
+  return t -> Update(id, tmp -> i);
 }
 
 int A::PrintStm::MaxArgs() const {
   // TODO: put your code here (lab1).
+  int exps_num = exps->NumExps();
+  int exps_max = exps->MaxArgs();
+  return exps_num > exps_max ? exps_num : exps_max;
 }
 
 Table *A::PrintStm::Interp(Table *t) const {
   // TODO: put your code here (lab1).
+  return exps->Interp(t)->t;
 }
 
+int A::IdExp::MaxArgs() const {
+  return 0;
+}
+
+IntAndTable *A::IdExp::Interp(Table *t) const {
+  return new IntAndTable(t -> Lookup(id), t);
+}
+
+int A::NumExp::MaxArgs() const {
+  return 0;
+}
+
+IntAndTable *A::NumExp::Interp(Table *t) const {
+    return new IntAndTable(num, t);
+}
+
+int A::OpExp::MaxArgs() const {
+  int left_num = left->MaxArgs();
+  int right_num = right->MaxArgs();
+  return left_num > right_num ? left_num : right_num;
+}
+
+IntAndTable *A::OpExp::Interp(Table *t) const {
+  IntAndTable *tmp = left->Interp(t);
+  int left_result = tmp->i;
+  tmp = right->Interp(tmp->t);
+  int right_result = tmp->i;
+  switch (oper){
+    case PLUS:
+      return new IntAndTable(left_result + right_result, tmp->t);
+      break;
+    case MINUS:
+      return new IntAndTable(left_result - right_result, tmp->t);
+      break;
+    case TIMES:
+      return new IntAndTable(left_result * right_result, tmp->t);
+      break;
+    case DIV:
+      return new IntAndTable(left_result / right_result, tmp->t);
+      break;
+    default:
+      break;
+  }
+}
+
+int A::EseqExp::MaxArgs() const {
+  int stm_num = stm->MaxArgs();
+  int exp_num = exp->MaxArgs();
+  return stm_num > exp_num ? stm_num : exp_num;
+}
+
+IntAndTable *A::EseqExp::Interp(Table *t) const { 
+  t = stm->Interp(t);
+  return exp->Interp(t);
+}
+
+int A::PairExpList::MaxArgs() const {
+  int exp_num = exp->MaxArgs();
+  int tail_num = tail->MaxArgs();
+  return exp_num > tail_num ? exp_num : tail_num;
+}
+
+int A::PairExpList::NumExps() const {
+  return 1 + tail->NumExps();
+}
+
+IntAndTable *A::PairExpList::Interp(Table *t) const {
+  IntAndTable *tmp = exp->Interp(t);
+  std::cout << tmp->i << ' ';
+  return tail->Interp(tmp->t);
+}
+
+int A::LastExpList::MaxArgs() const {
+  return exp->MaxArgs();
+}
+
+int A::LastExpList::NumExps() const {
+  return 1;
+}
+
+IntAndTable *A::LastExpList::Interp(Table *t) const {
+  IntAndTable *tmp = exp->Interp(t);
+  std::cout << tmp->i << '\n';
+  return tmp;
+}
 
 int Table::Lookup(const std::string &key) const {
   if (id == key) {

src/straightline/slp.h

@@ -59,13 +59,18 @@ class Exp {
   // TODO: you'll have to add some definitions here (lab1).
   // Hints: You may add interfaces like `int MaxArgs()`,
   //        and ` IntAndTable *Interp(Table *)`
+ public:
+  virtual int MaxArgs() const = 0;
+  virtual IntAndTable *Interp(Table *) const = 0;
 };
 
 class IdExp : public Exp {
  public:
   explicit IdExp(std::string id) : id(std::move(id)) {}
   // TODO: you'll have to add some definitions here (lab1).
-
+  int MaxArgs() const override;
+  IntAndTable *Interp(Table *t) const override;
+  
  private:
   std::string id;
 };
@@ -74,7 +79,8 @@ class NumExp : public Exp {
  public:
   explicit NumExp(int num) : num(num) {}
   // TODO: you'll have to add some definitions here.
-
+  int MaxArgs() const override;
+  IntAndTable *Interp(Table *t) const override;
  private:
   int num;
 };
@@ -83,6 +89,8 @@ class OpExp : public Exp {
  public:
   OpExp(Exp *left, BinOp oper, Exp *right)
       : left(left), oper(oper), right(right) {}
+  int MaxArgs() const override;
+  IntAndTable *Interp(Table *t) const override;
 
  private:
   Exp *left;
@@ -93,8 +101,10 @@ class OpExp : public Exp {
 class EseqExp : public Exp {
  public:
   EseqExp(Stm *stm, Exp *exp) : stm(stm), exp(exp) {}
+  int MaxArgs() const override;
+  IntAndTable *Interp(Table *t) const override;
 
- private:
+private:
   Stm *stm;
   Exp *exp;
 };
@@ -104,12 +114,19 @@ class ExpList {
   // TODO: you'll have to add some definitions here (lab1).
   // Hints: You may add interfaces like `int MaxArgs()`, `int NumExps()`,
   //        and ` IntAndTable *Interp(Table *)`
+  virtual int MaxArgs() const = 0;
+  virtual int NumExps() const = 0;
+  virtual IntAndTable *Interp(Table *) const = 0;
 };
 
 class PairExpList : public ExpList {
  public:
   PairExpList(Exp *exp, ExpList *tail) : exp(exp), tail(tail) {}
   // TODO: you'll have to add some definitions here (lab1).
+  int MaxArgs() const override;
+  int NumExps() const override;
+  IntAndTable *Interp(Table *t) const override;
+
  private:
   Exp *exp;
   ExpList *tail;
@@ -119,6 +136,9 @@ class LastExpList : public ExpList {
  public:
   LastExpList(Exp *exp) : exp(exp) {}
   // TODO: you'll have to add some definitions here (lab1).
+  int MaxArgs() const override;
+  int NumExps() const override;
+  IntAndTable *Interp(Table *t) const override;
  private:
   Exp *exp;
 };