Question

Using Java programming:

Modify the delimiter class (provided below) so that it can "incorrectly" evaluate simple parenthesized math expressions

.

a) ask the user for the whole expression to solve

b) Solve the expression only if there is no mismatch in the delimiters. If there is a mismatch, then output an error. If there is an error, allow the user to reenter a corrected/new expression.

c) The program should be able to evaluate expressions that uses only the following basic operations: +, - , *, and % (known as modulus)

d) The program should also work for single digit integers, along with multi-digit integers and/or double/floats

by the usage of "incorrectly", when reading a + operator, evaluate it as % (modulus). When a * is read, evaluate it as - (minus).

.

------------------------------------------

notes:

i) each operation should be explicitly written out using the basic operations, Instead of 4(2+9), it should be 4*(2+9)

ii) If the program encounters an invalid or implicit operator, then print a short but descriptive error. If there is an invalid or implicit operator, allow the user to fix the mistake or reenter the expression

-----------------------------------------

DELIMITER CLASS

.

.

import java.util.Scanner;
import java.util.Stack;
public class Delimiter {
   public static void main(String args[]) {
       Scanner in = new Scanner (System.in);
       String expression;
       System.out.print("Enter expression : ");
       expression = in.nextLine();
       if(check(expression))
           System.out.print(expression + " has no mismatch in the delimiters ");
       else
           System.out.print(expression + " has mismatch in the delimiters ");
    
       in.close();
   }

   public static boolean check(String expression) {
       Stack<Character> stack=new Stack<Character>();

for(int i=0;i<expression.length();i++)
{
char c=expression.charAt(i);
if (c == '{' || c == '(' || c == '[')
stack.push(c);

if (c == '}' || c == ')' || c == ']')
{
if (stack.isEmpty())
return false;

else if ( !isMatchingPair(stack.pop(), c) ) return false;
}
}
if (stack.isEmpty()) return true;
return false;
}
   public static boolean isMatchingPair(char character1, char character2)
   {
   if (character1 == '(' && character2 == ')')
   return true;
   else if (character1 == '{' && character2 == '}')
   return true;
   else if (character1 == '[' && character2 == ']')
   return true;
   else
   return false;
   }
}

Answer 1

(e data Solution This code i^on( no OpCrcdors ohaue corste a code -that e atch Hexe P tho cutput mekS7 Sptemaut Print ('Enter expresion) system, out .printin expreaion. h26 no mismedehin the de lim 它ㄚ

t beoleam Chec Conttnue st- push (sb to shingo st push (h to string) r cohon me ot)', pop and. talclate

Shing top ב St. Popes ele g

t adi (or elem) Corvect lahe Yelun Cenrect Stahe boolean 1ろopcr velturn true