Recursive descent parser Expression grammar

Grammar: Grammar used: 
  Production             Predict
EL --> Ex EL          ( INT
    |                 EOF
Ex --> E =            ( INT
E --> T E'            ( INT
E' --> + T E'         +
    |  - T E'         -
    |                 = )
T --> F T'            ( INT
T' --> * F T'         *
    |  / F T'         /
    |                 = )
F --> ( E )           (
    | INT             INT
Example input: 
3 * 4 + 2=
4 + 4 / 2 =
Version 1: parsing expressions. Version 2: Computing values for expressions.
The parser has been modified to compute the value of the input expression.