Create a program where you apply the concept of PDA (Pushdown automata) using stack where program will check if the input is a balanced symbols or not. See attached photo for the examples
Create a program where you apply the concept of PDA (Pushdown automata) using stack where program will check if the input is a balanced symbols or not. See attached photo for the examples
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Java
Create a program where you apply the concept of PDA (Pushdown automata) using stack where program will check if the input is a balanced symbols or not. See attached photo for the examples
![PUSH DOWN AUTOMATA PROGRAM
IN JAVA FOR EQUAL NO OF A'S AND
B'S
JUNE 5, 2015 ANKUR LEAVE A COMMENT
123456789912341516718 19 281223425 25 7 28 29 38 31 32 33 34 35368388245455558
10
20
26
27
30
37
39
40
41
47
49
import java.io.*;
class Pda {
}
static char st[] = new char[20];
static int ptr = 0;
static void push(char e) {
st[ptr] = e;
ptr++;
}
static void pop() {
ptr--;
}
public static void main(String Args[]) throws IOException
BufferedReader obj = new BufferedReader (new Inputstr
string ip;
System.out.println("Enter String:");
ip = obj.readLine();
int 1;
boolean f= false;
int i;
for (i = 0; i <ip.length(); i++) {
if (ip.charAt(i) == 'a') {
push('a');
For
for
If
} else {
}
50 /* OUTPUT
break;
(iip.length(); i++) {
if (ip.charAt(i) == 'a') {
f = false;
break;
} else {
}
(ptr == 0) {
f = true;
pop();
if (f == true) {
System.out.println("string Accepted");
System.out.println("string rejected");
} else {](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F09ca6621-3938-4d66-95d0-000192e6222d%2Fbeb70e43-047b-43b7-b837-0c46516b30cd%2F407oytd_processed.jpeg&w=3840&q=75)
Transcribed Image Text:PUSH DOWN AUTOMATA PROGRAM
IN JAVA FOR EQUAL NO OF A'S AND
B'S
JUNE 5, 2015 ANKUR LEAVE A COMMENT
123456789912341516718 19 281223425 25 7 28 29 38 31 32 33 34 35368388245455558
10
20
26
27
30
37
39
40
41
47
49
import java.io.*;
class Pda {
}
static char st[] = new char[20];
static int ptr = 0;
static void push(char e) {
st[ptr] = e;
ptr++;
}
static void pop() {
ptr--;
}
public static void main(String Args[]) throws IOException
BufferedReader obj = new BufferedReader (new Inputstr
string ip;
System.out.println("Enter String:");
ip = obj.readLine();
int 1;
boolean f= false;
int i;
for (i = 0; i <ip.length(); i++) {
if (ip.charAt(i) == 'a') {
push('a');
For
for
If
} else {
}
50 /* OUTPUT
break;
(iip.length(); i++) {
if (ip.charAt(i) == 'a') {
f = false;
break;
} else {
}
(ptr == 0) {
f = true;
pop();
if (f == true) {
System.out.println("string Accepted");
System.out.println("string rejected");
} else {
![5
46
47
48
ខខខ៨៨៣ ៦ ខ គ ១៩៩៩២៩២៩
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
String braces = sc.nextLine();
//split braces
String[] brace = braces.split("");
try {
66
67
68
69
70
71
72
for(int i = 0; i < braće.length; i++) {
//checks if top of stack matches
if(brace[i] == ")") {
73}
74
}
}
}
String top list.peek();
if(top
==
else
=
"(")
list.pop();
==
Jelse if(brace[i] "") {
if(list.peek() = "")
list.pop();.
System.out.println("These Braces are not Balanced!");break;
}
else
Jelse if(brace[i]
if(list.peek()
list.pop();
System.out.println("These Braces are not Balanced!"); break;
else
Jelse
list.push();
==
}catch(Exception e) {
System.out.println(e);
"}") {
="{")
System.out.println("These Braces are not Balanced!"); break;
ER
}catch(Exception e) {
System.out.println(e);
G&
I
Writable
Smart Insert
45:34:966
DR 31°C Cloudy](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F09ca6621-3938-4d66-95d0-000192e6222d%2Fbeb70e43-047b-43b7-b837-0c46516b30cd%2Fnrebkky_processed.jpeg&w=3840&q=75)
Transcribed Image Text:5
46
47
48
ខខខ៨៨៣ ៦ ខ គ ១៩៩៩២៩២៩
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
String braces = sc.nextLine();
//split braces
String[] brace = braces.split("");
try {
66
67
68
69
70
71
72
for(int i = 0; i < braće.length; i++) {
//checks if top of stack matches
if(brace[i] == ")") {
73}
74
}
}
}
String top list.peek();
if(top
==
else
=
"(")
list.pop();
==
Jelse if(brace[i] "") {
if(list.peek() = "")
list.pop();.
System.out.println("These Braces are not Balanced!");break;
}
else
Jelse if(brace[i]
if(list.peek()
list.pop();
System.out.println("These Braces are not Balanced!"); break;
else
Jelse
list.push();
==
}catch(Exception e) {
System.out.println(e);
"}") {
="{")
System.out.println("These Braces are not Balanced!"); break;
ER
}catch(Exception e) {
System.out.println(e);
G&
I
Writable
Smart Insert
45:34:966
DR 31°C Cloudy
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education