leverage ANTLR to implement a reverse polish calculator. Write code in Java

ADD MORE FUNC TO THE CODE BELOW TO HANDLE:

$**($power$,$ instead of $^),$ log$,$ ln$,$sin$,$ cos$,$ tan$,$ asin, acos, and atan, sinh$,$ cosh$,$ tanh$,!,$ e$,$ pi

CODE

import java.util.Scanner;

import java.util.Stack;

public class Main $\{$

public static void main$($String$[]$ args$)\{$

Scanner scanner $=$ new Scanner$($System$.$in$)$;

while $($scanner$.$hasNextLine$())\{$

String infix $=$ scanner.nextLine$()$;

String rpn $=$ infixToRPN$($infix$)$;

double result $=$ evaluateRPN$($rpn$)$;

System.out.println$($infix$)$;

System.out.println$($rpn$)$;

System.out.printf$("\%\mathrm{.}5$f$\%$n$",$ result$)$;

$\}$

scanner.close$()$; $//$ Closing the scanner to avoid resource leak

$\}$

$//$ Method to convert infix expression to Reverse Polish Notation $($RPN$)$

private static String infixToRPN$($String infix$)\{$

StringBuilder result $=$ new StringBuilder$()$;

Stack stack $=$ new Stack$<>()$;

for $($char c : infix.toCharArray$())\{$

if $($Character$.$isDigit$($c$)||$ c $==\text{'}.\text{'})\{$

result.append$($c$)$; $//$ Append operand directly to result

$\}$ else if $($c $==\text{'}(\text{'})\{$

stack.push$($c$)$; $//$ Push $\text{'}(\text{'}$ onto the stack

$\}$ else if $($c $==\text{'})\text{'})\{$

while $(!$stack.isEmpty$()$ && stack.peek$()!=\text{'}(\text{'})\{$

result.append$(\text{'}\text{'}).$append$($stack$.$pop$())$; $//$ Append operators to result until $\text{'}(\text{'}$ is encountered

$\}$

stack.pop$()$; $//$ Discard $\text{'}(\text{'}$

$\}$ else $\{$

while $(!$stack.isEmpty$()$ && precedence$($c$)<=$ precedence$($stack$.$peek$()))\{$

result.append$(\text{'}\text{'}).$append$($stack$.$pop$())$; $//$ Append operators with higher or equal precedence to result

$\}$

stack.push$($c$)$; $//$ Push current operator onto the stack

result.append$(\text{'}\text{'})$; $//$ Append space after operator

$\}$

$\}$

while $(!$stack.isEmpty$())\{$

result.append$(\text{'}\text{'}).$append$($stack$.$pop$())$; $//$ Append remaining operators to result

$\}$

return result.toString$().$trim$()$; $//$ Return trimmed RPN expression

$\}$

$//$ Method to determine precedence of operators

private static int precedence$($char operator$)\{$

switch $($operator$)\{$

case $\text{'}+\text{'}$:

case $\text{'}-\text{'}$:

return $1$;

case $\text{'}*\text{'}$:

case $\text{'}/\text{'}$:

return $2$;

default:

return $0$;

$\}$

$\}$

$//$ Method to evaluate RPN expression

private static double evaluateRPN$($String rpn$)\{$

Stack stack $=$ new Stack$<>()$;

for $($String token : rpn$.$split$("\backslash \backslash$s$+"))\{$

if $($token$.$matches$("[+-]?\backslash \backslash$d$+(\backslash \backslash .\backslash \backslash$d$+)?"))\{$

stack.push$($Double$.$parseDouble$($token$))$; $//$ Push operands onto stack

$\}$ else $\{$

double b $=$ stack.pop$()$; $//$ Pop top two operands from stack

double a $=$ stack.pop$()$;

switch $($token$)\{$

case $"+"$:

stack.push$($a $+$ b$)$; $//$ Perform addition

break;

case $"-"$:

stack.push$($a $-$ b$)$; $//$ Perform subtraction

break;

case $"*"$:

stack.push$($a $*$ b$)$; $//$ Perform multiplication

break;

case $"/"$:

if $($b $==0)\{$

throw new ArithmeticException$("$Division by zero"$)$; $//$ Handle division by zero

$\}$

stack.push$($a $/$ b$)$; $//$ Perform division

break;

default:

throw new IllegalArgumentException$("$Invalid operator: $"+$ token$)$; $//$ Handle invalid operator

$\}$

$\}$

$\}$

return stack.pop$()$; $//$ Return final result

$\}$

$\}$

OUTPUInput expression Reverse Polish expression Computation result

$(1+2)!-$:$(3-4**2)12+!342**--$: $-0\mathrm{.}46154$

sin $(\backslash$pi $-$:$6)\backslash$pi $6-$:sin $0\mathrm{.}5$

ln$($e$**3)$ e $3**$ln $3$