1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/* SI 413 Fall 2013
 * Recursive descent parser and interpreter
 * for a simple calculator language.
 */
 
#include <iostream>
#include <cstdlib>
#include "bisoncalc.tab.hpp"
using namespace std;
 
//-- Prototypes and globals
int yylex();
 
void stmt(); 
int exp();  int exptail(int lhs); 
int term(); int termtail(int lhs); 
int factor(); 
int next = -1;
YYSTYPE nextval;
 
//-- Helper functions
void perror(const char* nt) { 
  cerr << "Parse error in " << nt << endl; 
  exit(1); 
}
 
int peek() { 
  if (next == -1) {
    next = yylex(); 
    nextval = yylval;
  }
  return next; 
}
 
// Returns the value of the matched token
YYSTYPE match(int tok) { 
  if (tok == peek()) {
    next = -1; 
    return nextval;
  }
  else perror("match"); 
}
 
//-- Grammar rule functions
void stmt() { 
  cout << exp() << endl; 
  match(STOP); 
}
 
int exp() { 
  int first = term();
  return exptail(first); 
}
 
int exptail(int lhs) {
  switch(peek()) {
    case OPA: 
      if (match(OPA).sym == '+') {
        int next = term(); 
        return exptail(lhs + next);
      }
      else {
        int next = term();
        return exptail(lhs - next); 
      }
      break;
    case RP: case STOP: 
      return lhs; break;
    default: 
      perror("exptail"); break;
  }
}
 
int term() { 
  int first = factor(); 
  return termtail(first); 
}
 
int termtail(int lhs) {
  switch(peek()) {
    case OPM: 
      if (match(OPM).sym == '*') {
        int next = factor(); 
        return termtail(lhs * next); 
      }
      else {
        int next = factor();
        return termtail(lhs / next);
      }
      break;
    case RP: case STOP: case OPA: 
      return lhs; 
      break;
    default: 
      perror("term"); 
      break;    
  }
}
 
int factor() {
  int val;
  switch(peek()) {
    case NUM: 
      return match(NUM).val; break;
    case LP: 
      match(LP); 
      val = exp(); 
      match(RP); 
      return val;
      break;
    default: perror("factor"); break;
  }
}
 
int main() { 
  while(true) {
    cout << "> " << flush;
    if (peek() == 0) break;
    stmt();
  }
  cout << endl;
  return 0;
}