[go: up one dir, main page]
Scribd
Upload
24 views1 page

Delimiter

Uploaded by

shivali.mali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views1 page

Delimiter

Uploaded by

shivali.mali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Data Structure and Lab (DSL) SE Computer Engineering

Practical No:11(D)
Practical Title: Write C++ program to check well formedness of parenthesis using stack.
Aim: In any language program mostly syntax error occurs due to unbalancing delimiter such as (),
{},[]. Write C++ program using stack to check whether given expression is well parenthesized or
not.
Pre-requisite:

• Basics of stack.
• Different operations that can be performed on stack

Objective:
• To check whether the given expression is well parenthesized or not.

Input:
Expresstion using {},(),[].

Outcome:
• Result of checking well formedness of parenthesis.

Theory :
- Write short theory of stack.
- Write concept of well form parenthesis.
- Example of well form parenthesis.

Algorithms :
Write your own algorithms

Flowchart :
Draw flowchart for above algorithms.

Conclusion:
By this way, we can check well formedness of parenthesis using stack.
A P J Total
Dated Sign
3 4 3 10

Question Bank:
1. What is Stack?
2. Which are the different operations that can be performed on stack?
3. Explain PUSH, POP operations on stack
4. What are the applications of stack?

Pune Vidyarthi Griha’s College of Engineering, nashik. Prof. Anand N. Gharu

You might also like