This is a Java Program to Check for balanced parenthesis by using Stacks. Parenthesis matching is commonly used for evaluating arithmetic expressions and in editors for validating syntax.
Here is the source code of the Java Program to check for balanced parenthesis by using stacks. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/* * Java Program to Check for balanced paranthesis by using Stacks */ import java.util.*; public class ParenthesisMatching { public static void main(String[] args) { Scanner scan = new Scanner(System.in); /* Creating Stack */ Stack<Integer> stk = new Stack<Integer>(); System.out.println("Parenthesis Matching Test\n"); /* Accepting expression */ System.out.println("Enter expression"); String exp = scan.next(); int len = exp.length(); System.out.println("\nMatches and Mismatches:\n"); for (int i = 0; i < len; i++) { char ch = exp.charAt(i); if (ch == '(') stk.push(i); else if (ch == ')') { try { int p = stk.pop() + 1; System.out.println("')' at index "+(i+1)+" matched with ')' at index "+p); } catch(Exception e) { System.out.println("')' at index "+(i+1)+" is unmatched"); } } } while (!stk.isEmpty() ) System.out.println("'(' at index "+(stk.pop() +1)+" is unmatched"); } }
Parenthesis Matching Test Enter expression (a+(b*c)-d) Matches and Mismatches: ')' at index 8 matched with ')' at index 4 ')' at index 11 matched with ')' at index 1 Parenthesis Matching Test Enter expression ((x+y/(z-w)) Matches and Mismatches: ')' at index 11 matched with ')' at index 7 ')' at index 12 matched with ')' at index 2 '(' at index 1 is unmatched Parenthesis Matching Test Enter expression (a+b*(c-d)-(e-f/(g+h*(k-i)/(l-j+k Matches and Mismatches: ')' at index 10 matched with ')' at index 6 ')' at index 26 matched with ')' at index 22 '(' at index 28 is unmatched '(' at index 17 is unmatched '(' at index 12 is unmatched '(' at index 1 is unmatched
Related posts:
Java Program to Implement WeakHashMap API
Java Program to Generate Random Partition out of a Given Set of Numbers or Characters
Introduction to Spring Cloud CLI
Java Program to Implement Fibonacci Heap
Serialization và Deserialization trong java
Java Program to Search for an Element in a Binary Search Tree
Guide to Spring 5 WebFlux
Java Program to Implement Self organizing List
Implementing a Binary Tree in Java
A Guide To UDP In Java
Java Program to Implement Booth Algorithm
Hướng dẫn sử dụng luồng vào ra ký tự trong Java
Java Program to Implement Direct Addressing Tables
Spring Boot - Bootstrapping
Spring Data – CrudRepository save() Method
Java Program to implement Bit Set
Java Program to Check Whether a Directed Graph Contains a Eulerian Path
Java – Reader to Byte Array
Java Program to Describe the Representation of Graph using Adjacency List
Control Structures in Java
Java Program to Construct an Expression Tree for an Infix Expression
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
How to Remove the Last Character of a String?
Java Program to Generate Random Hexadecimal Byte
Concurrent Test Execution in Spring 5
Java Program to Perform Optimal Paranthesization Using Dynamic Programming
How to Delay Code Execution in Java
Java Program to Perform Arithmetic Operations on Numbers of Size
Java Program to Implement Multi-Threaded Version of Binary Search Tree
Java Program to Implement Regular Falsi Algorithm
Giới thiệu Google Guice – Aspect Oriented Programming (AOP)
Tránh lỗi ConcurrentModificationException trong Java như thế nào?