1. Implement a Stack using a linked-list. 2. Use the stack in making a program that will check whether a string contains balance symbols [], {}, (). The algorithm works like this - an open symbol -- (, {,[ -- is pushed on the stack. When a closed symbol -- ], }, ) - is encountered, check the top of the stack to see if the matching open symbol is there, if yes, pop the stack, otherwise, mismatch. At the end of the string, the stack should be empty.

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
icon
Related questions
Question
100%
(Don't use C++) Only use C
Objectives:
Implement a Stack using a Linked-list
Description
A Stack is a last-in-first-out (LIFO data Structure)
// data structure LIFO
typedef char stackltem;
Stack newStack();
void freeStack(Stack s);
void push(Stack s,stackltem item); // insert at the top -
void pop(Stack s); // deleting the top element - pop
stackltem stackTop(Stack s); // returns the top item
int is Empty(Stack s);
void display(Stack s);
push
1. Implement a Stack using a linked-list.
2. Use the stack in making a program that will check whether a string contains
balance symbols [], {}, (). The algorithm works like this - an open symbol -- (, {,[
is pushed on the stack. When a closed symbol -- ], }, ) - is encountered, check
the top of the stack to see if the matching open symbol is there, if yes, pop the
stack, otherwise, mismatch. At the end of the string, the stack should be empty.
Remarks
Use the Project Name - StackLink which includes Stack.h, Stack.c, main.c.
Transcribed Image Text:Objectives: Implement a Stack using a Linked-list Description A Stack is a last-in-first-out (LIFO data Structure) // data structure LIFO typedef char stackltem; Stack newStack(); void freeStack(Stack s); void push(Stack s,stackltem item); // insert at the top - void pop(Stack s); // deleting the top element - pop stackltem stackTop(Stack s); // returns the top item int is Empty(Stack s); void display(Stack s); push 1. Implement a Stack using a linked-list. 2. Use the stack in making a program that will check whether a string contains balance symbols [], {}, (). The algorithm works like this - an open symbol -- (, {,[ is pushed on the stack. When a closed symbol -- ], }, ) - is encountered, check the top of the stack to see if the matching open symbol is there, if yes, pop the stack, otherwise, mismatch. At the end of the string, the stack should be empty. Remarks Use the Project Name - StackLink which includes Stack.h, Stack.c, main.c.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Concept of Threads
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education