Java代写:CS112 Expression Evaluation

使用Stack实现算式计算器Formula calculator,相比常规的计算器,需要使用Recursion,以及表达式中包含变量,增加了难度。

Formula calculator


In this assignment you will implement a program to evaluate an arithmetic expression USING RECURSION AND STACKS.


Here are some sample expressions of the kind your program will evaluate:

3-4*5 a-(b+A[B[2]])*d+3
(varx + vary*varz[(vara+varb[(a+b)*33])])/55

The expressions will be restricted to the following components:

  • Integer constants
  • Scalar (simple, non-array) variables with integer values
  • Arrays of integers, indexed with a constant or a subexpression
  • Addition, subtraction, multiplication, and division operators
  • Parenthesized subexpressions

Note the following:

  • Subexpressions (including indexes into arrays between ‘[‘ and ‘]’) may be nested to any level
  • Multiplication and division have higher precedence than addition and subtraction
  • Variable names (either scalars or arrays) will be made up of one or more letters ONLY (nothing but letters a-z and A-Z), are case sensitive (Xyz is different from xyz) and will be unique.
  • Integer constants may have multiple digits
  • There may any number of spaces or tabs between any pair of tokens in the expression. Tokens are variable names, constants, parentheses, square brackets, and operators.

Implementation and Grading

Download the attached file to your computer. DO NOT unzip it.
Instead, follow the instructions on the Eclipse page under the section “Importing a Zipped Project into Eclipse” to get the entire project into your Eclipse workspace.
You will see a project called Expression Evaluation with the following classes in package apps:

  • ScalarSymbol
    This class represents a simple variable with a single value. Your implementation will create a ScalarSymbol object for every simple variable in the expression. You don’t have to implement anything in this class, so do not make any changes to it.
  • ArraySymbol
    This class represents an array of integer values. Your implementation will create an ArraySymbol object for every array variable in the expression. You don’t have to implement anything in this class, so do not make any changes to it.
  • Expression
    This class represents the expression as a whole, and consists all the following steps of the evaluation process:
    1. (25 points) buildSymbols - This method populates the two instance fields, scalars and arrays , with all simple (scalar) variables, and all array variables, respectively, that appear in the expression. You will fill in the implementation of this method. Make sure to read the comments above the method header to get more details.
    2. loadSymbolValues - This method reads values for all scalars and arrays from a file, into the ScalarSymbol and ArraySymbol objects stored in the scalars and arrays array lists. This method is already implemented, do not make any changes.
    3. (75 points) evaluate - This method evaluates the expression. You will fill in the implementation of this method. You MUST use RECURSION to evaluate parenthesized subexpressions and array index expressions. You can write a separate private recursive method and call it from this public method.
      Two other methods, printScalars and printArrays are implemented for your convenience, and may be used to verify the correctness of the scalars and arrays lists after the buildSymbols and loadSymbolValues methods.
  • Evaluator , the application driver, which calls methods in Expression
    You are also given the following class in package structures:
  • Stack , to be used in the evaluation process
    Lastly, two test files are included, etest1.txt and etest2.txt, appearing directly under the project folder.

Do not add any other classes. In particular, do NOT use your own stack class, ONLY use the one you are given. The reason is, we will be using this same Stack class when we test your solution.

Notes on tokenizing the expression

You will need to separate out (“tokenize”) the components of the expression in buildSymbols and evaluate . Tokens include operands (variables and constants), operators ( ‘+’,’-‘,’*’,’/‘ ), parentheses and square brackets.

It may be helpful (but you are not required) to use java.util.StringTokenizer to tokenize the expression. See the loadSymbolValues method in Expression for an example of using StringTokenizer to extract variable names. The delims field in the Expression class may be used in the tokenizing process.

The documentation of the StringTokenizer class says this:

"StringTokenizer is a legacy class that is retained for compatibility reasons although its use is discouraged in new code. It is recommended that anyone seeking this functionality use the split method of String or the java.util.regex package instead."

For the purpose of this assignment, you may use StringTokenizer without issue. Alternatively, you may use the split method of the String class, or the Pattern and Matcher classes in the package java.util.regex .

Or, you may simply parse the expression by scanning it a character at a time.

Rules while working on

  • You may NOT add any import statements to the file. Note that the*, java.util.*, and java.util.regex.* import statements at the top of the file allow for using ANY class in, java.util, and java.util.regex without additional specification or qualification.
  • You may NOT add any fields to the Expression class.
  • You may NOT modify the headers of any of the given methods.
  • You may NOT delete any methods.
  • You MAY add helper methods if needed, as long as you make them private . (Including the recursive evaluate method discussed below.)

Rules and guidelines for implementing evaluate

  • An expression may contain sub-expressions within parentheses - you MUST use RECURSION to evaluate sub-expressions.
    In order to recurse on a subexpression, you will need to write a separate private recursive evaluate method.
    One option is for this recursive method to accept as parameters two indexes that mark the start and end of the subexpression in the main expression. So, for instance, if the main expression is

    01234567891111111 (these are the positions of the chracters in the expression)

then, to recursively evaluate the subexpression in parantheses, you may call the recursive evaluate method like this:

float res = evaluate(expr, 3, 11);

To start with, you may call the recursive evaluate method from the public evaluate method like this (for the above expression):

return evaluate(expr, 0, expr.length()-1);

which is the entire expression.

Another option is to have your recursive evaluate can accept a string as a parameter, for the subexpression you want to evaluate. In which case, for the parenthesized subexpression above, you can call it like this:

float res = evaluate(expr.substring(3,12));

And the initial call from the public evaluate method would simply be:

return evaluate(expr);

You can include other parameters in your recursive evaluate, as necessary. When testing, we will not directly call your recursive evaluate, only the public evaluate method with no parameters.

  • Recursion MUST also be used to evaluate array subscripts (within ‘[ and ‘]’), since a subscript is an expression. Use the same process as above to do the recursive call for the subscript expression.
  • A stack may be used to store the values of operands as well as the results from evaluating subexpressions - see next point.-
  • Since * and / have precedence over + and - , it would help to store operators in another stack. (Think of how you would evaluate a+b*c with operands/intermediate results on one stack and operators on the other.)
  • When you implement the evaluate method, you may want to test as you go, implementing code for and testing simple expressions, then building up to more complex expressions. The following is an example sequence of the kinds of expressions you may want to build with:
    • 3
    • a
    • 3+4
    • a+b
    • 3+4*5
    • a+b*c
    • Then introduce parentheses
    • Then try nested parentheses
    • Then introduce array subscripts, but no parentheses
    • Then try nested subscripts, but no parentheses
    • Then try using parentheses as well as array subscripts
    • Then try mixing arrays within parentheses, parentheses within array subscripts, etc.
      You may assume that all input expressions will be correctly formatted, so you don’t need to do any checking of the input expression for correctness.

You may also assume that all input symbol values files will be correctly formatted, and every file will be guaranteed to have values for all symbols in the expression that is being evaluated. So that when you do the evaluation, after loadSymbolValues runs, all required scalar and array values for evaluation will be correctly present in the arrays and scalars lists.


When we test your evaluate method, we will use OUR implementation of the buildSymbols method. This is for your benefit, so that in the event that your buildSymbols does not work correctly, your evaluate method will not be adversely affected.

Running the evaluator

You can test your implementation by running the Evaluator driver on various expressions and input symbol values file.

When creating your own symbol values files for testing, make sure they are directly under the project folder, alongside etest1.txt and etest2.txt .

Since you are not going to turn in the file, you may introduce debugging statements in it as needed.

No variables

Enter the expression, or hit return to quit => 3
Enter symbol values file name, or hit return if no symbols =>
Value of expression = 3.0

Enter the expression, or hit return to quit => 3-4*5
Enter symbol values file name, or hit return if no symbols =>
Value of expression = -17.0

Enter the expression, or hit return to quit =>

Neither of the expressions above have variables, so just hit return to skip the symbol loading part.

Variables, values loaded from file

Enter the expression, or hit return to quit => a
Enter symbol values file name, or hit return if no symbols => etest1.txt
Value of expression = 3.0
Enter the expression, or hit return to quit =>

Since the expression has a variable, a, the evaluator needs to be supplied with a file that has a value for it. Here’s what etest1.txt looks like:

a 3
b 2
A 5 (2,3) (4,5)
B 3 (2,1)
d 56

Each line of the file begins with a variable name. For scalar variables, the name is followed by the variable’s integer value. For array variables, the name is followed by the array’s length, which is followed by a series of (index,integer value) pairs.

Note: The index and integer value pairs must be written with no spaces around the index or integer value.
So, for instance, (2, 3) or ( 2,3) or (2 ,3) are all incorrect.
Make sure you adhere to this requirement when you create your own input files for testing.
If the value at a particular array index is not explicitly listed, it is set to 0 by default.
So, in the example above, A = [0,0,3,0,5] and B = [0,0,1]
Note that the symbol values file can have values for any number of symbols, so that it can be used as input for several expressions that contain one or more of the symbols in the file.

Here are a couple more evaluations of expressions for which the symbol values are loaded from etest1.txt :

Enter the expression, or hit return to quit => (a + A[a*2-b])
Enter symbol values file name, or hit return if no symbols => etest1.txt
Value of expression = 8.0

Enter the expression, or hit return to quit => a - (b+A[B[2]])*d + 3
Enter symbol values file name, or hit return if no symbols => etest1.txt
Value of expression = -106.0

Enter the expression, or hit return to quit =>

For a change of pace, here’s etest2.txt, which has the following symbols and values:

varx 6
vary 5
arrayA 10 (3,5) (8,12) (9,1)

And here are evaluations using this file:

Enter the expression, or hit return to quit => arrayA[arrayA[9]*(arrayA[3]+2)+1]-varx
Enter symbol values file name, or hit return if no symbols => etest2.txt
Value of expression = 6.0

Enter the expression, or hit return to quit =>


Submit your file ONLY.

Frequently Asked Questions

Q: Are array names all uppercase?
A: No. Arrays could have lower case letters in their names. You can tell if a variable is an array if it is followed by an opening square bracket. See, for example, the last example in the “Expression” section, in which varb and varz are arrays:

(varx + vary*varz[(vara+varb[(a+b)*33])])/55

Q: Can we delete spaces from the expression?
A: Sure.
Q: Will the expression contain negative numbers?
A: No. The expression will NOT have things like a*-3 or x+(-y) . It will ONLY have the BINARY operators +, -, /, and *. In other words, each of these operators will need two values (operands)to work on. (The - in front of 3 in a*-3 is called a UNARY minus. UNARY operators will NOT appear in the input expression.)
However, it is possible that in the process of evaluating the expression, you come across negative values, either because they appear in the input file, or because they are the result of evaluation. For instance, when evaluating a+b, a=6 and b=-9 as input values, and a result of -3 is a perfectly legitimate scenario.
Q: What if an array index evaluates to a non-integer such as 5/2?
A: Truncate it and use the resulting integer as the index.
Q: Could an array index evaluate to a negative integer?
A: No, you will not be given any input expression or values that would result in a negative integer value for an array index. In other words, you will not need to account for this situation in your code.
Q: Could an array name be the same as a scalar?
A: No. All variable names, for both scalars and arrays, are unique.
Q: Should the expression “()” be reported as an error?
A: You don’t have to do any error checking on the legality of the expression in the buildSymbols or evaluate methods. When these methods are called, you may assume that the expression is correctly constructed. Which means you will not encounter an expression without at least one constant or variable, and all parens and brackets will be correctly formatted. Which means you won’t need to deal with “()”.
Q: Can I convert the expression to postfix, then evaluate the postfix expression?
A: NO!!! You have to work with the given traditional/infix form of the expression