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 the Binary Counting Method to Generate Subsets of a Set
Java Program to find the maximum subarray sum using Binary Search approach
Jackson – Bidirectional Relationships
Java Program to Check whether Graph is a Bipartite using 2 Color Algorithm
Java Program to Delete a Particular Node in a Tree Without Using Recursion
An Introduction to ThreadLocal in Java
Spring Boot - Exception Handling
Quick Guide to java.lang.System
Java Program to Implement Hash Tables
Spring WebClient and OAuth2 Support
A Guide to TreeMap in Java
Spring Boot - Admin Client
Java – Convert File to InputStream
Java Program to Check Multiplicability of Two Matrices
Wrapper Classes in Java
Mệnh đề if-else trong java
Command-Line Arguments in Java
Spring WebClient Filters
Luồng Daemon (Daemon Thread) trong Java
Java Program to Implement Uniform-Cost Search
Java Program to Implement Depth-limited Search
A Guide to WatchService in Java NIO2
Enum trong java
JPA/Hibernate Persistence Context
Automatic Property Expansion with Spring Boot
Java – Rename or Move a File
Java Copy Constructor
The Guide to RestTemplate
Custom Exception trong Java
Converting a Stack Trace to a String in Java
Java Program for Douglas-Peucker Algorithm Implementation
Java 9 Stream API Improvements