Java Program to Check for balanced parenthesis by using Stacks

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 Disjoint Sets
Extract links from an HTML page
4 tính chất của lập trình hướng đối tượng trong Java
Java – String to Reader
Lớp HashMap trong Java
Java Program to Implement Double Order Traversal of a Binary Tree
Java Program to Implement ArrayBlockingQueue API
Java Program to Compute Determinant of a Matrix
Spring Boot - Service Components
Configuring a DataSource Programmatically in Spring Boot
Spring Cloud AWS – EC2
Java Program to Construct a Random Graph by the Method of Random Edge Selection
Java – Reader to InputStream
Comparing getPath(), getAbsolutePath(), and getCanonicalPath() in Java
Debug a JavaMail Program
Introduction to Java Serialization
Tìm hiểu về Web Service
Luồng Daemon (Daemon Thread) trong Java
Hướng dẫn Java Design Pattern – Abstract Factory
Java Program to Print the Kind of Rotation the AVL Tree is Undergoing
Java Program to Perform Deletion in a BST
How to Define a Spring Boot Filter?
Extra Login Fields with Spring Security
Adding a Newline Character to a String in Java
Simple Single Sign-On with Spring Security OAuth2
Java Program to Implement Stack
Java Program to Implement Gaussian Elimination Algorithm
Java Program to do a Depth First Search/Traversal on a graph non-recursively
Java Program to Find the Shortest Path Between Two Vertices Using Dijkstra’s Algorithm
Hướng dẫn Java Design Pattern – Prototype
Send an email with an attachment
Java Program to Implement Park-Miller Random Number Generation Algorithm