Big Java, Binder Ready Version: Early Objects
Big Java, Binder Ready Version: Early Objects
6th Edition
ISBN: 9781119056447
Author: Cay S. Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 13, Problem 21PE
Program Plan Intro

Expression Evaluator

Program plan:

Filename: “Evaluator.java”

This code snippet creates a class “Evaluator”. In the code,

  • Define a class “Evaluator”.
    • Declare the class member “tokenizer”.
    • Define a constructor “Evaluator()”.
      • Define “tokenizer”.
    • Define the method “getExpressionValue()”.
      • Set “value”.
      • Declare “done”.
      • While true,
        • Get the token to “next”.
        • If “next” equal to “+” or “-”,
          • Call “nextToken()” to get the token.
          • Define “value2”.
          • If “next” equal to “+”,
            • Evaluate “value”.
          • Else,
            • Evaluate “value”.
        • Else,
          • Set “done” equal to “true”.
              • Return “value”.
    • Define the method “getTermValue()”.
      • Set “value”.
      • Declare “done”.
      • While true,
        • Get the token to “next”.
        • If “next” equal to “*” or “/” or “%”,
          • Call “nextToken()” to get the token.
          • Define “value2”.
          • If “next” equal to “*”,
            • Evaluate “value”.
          • Else if “next” equal to “/”,
            • Evaluate “value”.
          • Else,
            • Set the “value”.
        • Else,
          • Set “done” equal to “true”.
              • Return “value”.
    • Define the method “getExponentiationValue()”.
      • Set “value”.
      • Declare “done”.
      • While true,
        • Get the token to “next”.
        • If “next” equal to “^”.
          • Call “nextToken()” to get the token.
          • Define “value2”.
          • Set the “value”.
        • Else,
          • Set “done” equal to “true”.
              • Return “value”.
    • Define the method “getFactorValue()”.
      • Set “value”.
      • Set the value of “next”.
      • If “next” equal to “^”.
        • Call “nextToken()” to get the token.
        • Define “value”.
        • Call “nextToken()”
              • Else,
                • Set “value”.
              • Return “value”.

Filename: “ExpressionTokenizer.java”

This code snippet creates a class “ExpressionTokenizer”. In the code,

  • Define a class “ExpressionTokenizer”.
    • Declare a string “input”.
    • Declare an integer “start”.
    • Declare an integer “end”.
    • Define a constructor “ExpressionTokenizer()”.
      • Set the value of class members “input”, “start” and “end”.
      • Call “nextToken()”.
    • Define the method “peekToken()”.
      • If the value of “start” is greater than or equal to length of “input”.
        • Return “null”.
          • Else,
            • Return substring of “input”.
    • Define the method “nextToken()”.
      • Set the value of “start” equal to “end”.
      • While “true”,
        • Increment the value of “start” by 1.
          • If the condition is true,
            • Return the value of “r”.
          • If the condition is true,
            • Set “end” equal to “start+1”.
            • While “true”,
              • Increment the “end” by 1.
          • Else,
            • Set “end” equal to “start+1”.
          • Return the value of “r”.

Filename: “expressionCalculator.java”

This code snippet creates a class “expressionCalculator”. In the code,

  • Define a class “expressionCalculator”.
    • Define the “main” method.
      • Define the object of the class “Scanner”.
      • Prompt the user to enter the expression.
      • Scan for the “input”.
      • Define the object of class “Evaluator”.
      • Set the “value”.
      • Print new line.
      • Print the value of “input” and “value”.

Blurred answer
Students have asked these similar questions
Activity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.
Given the following Extended-BNF grammar of the basic mathematical expressions:  Show the derivation steps for the expression: ( 2 + 3 ) * 6 – 20 / ( 3 + 1 ) Draw the parsing tree of this expression. SEE IMAGE
Whentheuserenters!!,themostrecentcommandinthehistoryisexecuted.In the example above, if the user entered the command: Osh> !! The ‘ls -l’ command should be executed and echoed on user’s screen. The command should also be placed in the history buffer as the next command. Whentheuserentersasingle!followedbyanintegerN,theNthcommandin the history is executed. In the example above, if the user entered the command: Osh> ! 3 The ‘ps’ command should be executed and echoed on the user’s screen. The command should also be placed in the history buffer as the next command. Error handling: The program should also manage basic error handling. For example, if there are no commands in the history, entering !! should result in a message “No commands in history.” Also, if there is no command corresponding to the number entered with the single !, the program should output "No such command in history."

Chapter 13 Solutions

Big Java, Binder Ready Version: Early Objects

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education