- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Explain the balancing parenthesis of PDA
Pushdown Automata (PDA) are the finite automata (FAs), but with the ability to push and pop symbols to/from a stack.
PDA accepts strings if there is a legal path from start state to acceptance state for input. Otherwise, the string is rejected.
A PDA can be represented by a 7-tuple
(Q, ∑, ℾ, q0, ha, ∆,δ)
Where
The PDA is to finite subsets of Q ☓ (ℾ ∪ {∆})*.
Parentheses are balanced if
- While reading string, number of opening parentheses >= number of closing parentheses.
- When string is read, number of opening parentheses = number of closing parentheses.
Examples
- (())() − Balanced
- ((()() − Not balanced
- )()(() − Not balanced
The context free grammar (CFG) is as follows −
S -> (S) | SS | ε
PDA for balancing brackets
Each (is pushed, each) causes an (to be popped). This is shown below
Updated on 16-Jun-2021 13:04:29
- Related Questions & Answers
- All ways of balancing n parenthesis in JavaScript
- Explain Turing Machine variant Two Stack PDA?
- What is the Instantaneous description of PDA?
- JavaScript: Balancing parentheses
- Design a PDA which recognizes the language
- Optimal Account Balancing in C++
- Balancing two arrays in JavaScript
- Find numbers of balancing positions in string in C++
- Valid Parenthesis String in C++
- What is the use of ()(parenthesis) brackets in accessing a function in JavaScript?
- C++ Program to Implement self Balancing Binary Search Tree
- Explain the architecture of JDBC?
- Explain the features of JavaFX
- Explain the purpose of UDP?
- Explain the characteristics of DBMS?
Advertisements