C++Write a program that takes as input an arithmetic expression followed by a semicolon ;.The program outputs whether the expression contains matching grouping symbols.For example, the arithmetic expressions {25 + (3 – 6) * 8} and 7 + 8 * 2 contains matching grouping symbols.However, the expression 5 + {(13 + 7) / 8 - 2 * 9 does not contain matching grouping symbols.If the expression contains matching grouping symbols, the program output should contain the following text:Expression has matching grouping symbolIf the expression does not contain matching grouping symbols, the program output should contain the following text:Expression does not have matching grouping symbols. main.cppmyStackhstackA)Th+main.cpp3 #1jnaеJ H_StackType4 #define H_StackTypemyStack.h6 #include 7 #include 89 #include "stackADT.h"1011 using namespace std;123813 template 14 class stackType: public stackADT15 {16 public:17 const stackType& operator= (const stackType&);1819void initializeStack();bool isEmptyStack() const;bool isFullStack() const;stackADT.hvoid push(const Type& newItem);Type top() const;void pop();stackType(int stackSize = 100);stackType(const stackType& otherStack);~stackType();template void stackType::initializeStack(){1}stackTop = 0;template bool stackType::1sEmptyStack() const3 {return(stackTop == 0);>}template bool stackType::isFullStack() constH{return(stackTop==maxStackSize);3}+template void stackType::push(const Type& newItem)}{InstructionsInstructionsWrite a program that takes as input an arithmetic expression followed bya semicolon ;The program outputs whether the expression contains matchinggrouping symbols.For example, the arithmetic expressions (25+ (3-6)* 8} and7 + 8 * 2 contains matching grouping symbols.However, the expression 5 + {(13 + 7) / 8 - 2* 9 does notcontain matching grouping symbols.If the expression contains matching grouping symbols, the programoutput should contain the following text:Expression has matching grouping symbolIf the expression does not contain matching grouping symbols, theprogram output should contain the following text:Expression does not have matching grouping symbols.main.cppmyStack.h1 //Header file: stackADT.h23 #ifndef H_StackADT4 #define H_StackADT56 template 7 class stackADT89 public:10111213141516171819virtual void initializeStack() = 0;virtual bool isEmptyStack() const = 0;virtual bool isFullStack() const = 0;virtual void push(const Type& newItem) = 0;virtual Type top() const = 0;stackADT.h202122232425 };2627 #endif28virtual void pop() = 0;

Coding: #include<iostream>#include<stack>#include<string>using namespace std;…

C++ Write a program that takes as input an arithmetic expression followed by a semicolon ;. The program outputs whether the expression contains matching grouping symbols. For example, the arithmetic expressions {25 + (3 – 6) * 8} and 7 + 8 * 2 contains matching grouping symbols. However, the expression 5 + {(13 + 7) / 8 - 2 * 9 does not contain matching grouping symbols. If the expression contains matching grouping symbols, the program output should contain the following text: Expression has matching grouping symbol If the expression does not contain matching grouping symbols, the program output should contain the following text: Expression does not have matching grouping symbols

C++ Write a program that takes as input an arithmetic expression followed by a semicolon ;. The program outputs whether the expression contains matching grouping symbols. For example, the arithmetic expressions {25 + (3 – 6) * 8} and 7 + 8 * 2 contains matching grouping symbols. However, the expression 5 + {(13 + 7) / 8 - 2 * 9 does not contain matching grouping symbols. If the expression contains matching grouping symbols, the program output should contain the following text: Expression has matching grouping symbol If the expression does not contain matching grouping symbols, the program output should contain the following text: Expression does not have matching grouping symbols

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

#ifndef H_StackType#define H_StackType#include <iostream>#include <cassert>using namespace std;template <class Type>struct nodeType{ Type info; nodeType<Type> *link;};template <class Type>class linkedStackType: public stackADT<Type>class linkedStackType{public: const linkedStackType<Type>& operator= (const linkedStackType<Type>&); bool isEmptyStack() const; bool isFullStack() const; void initializeStack(); //Function to initialize the stack to an empty state. void push(const Type& newItem); Type top() const; //Function to return the top element of the stack. //Precondition: The stack exists and is not empty. //Postcondition: If the stack is empty, the program // terminates; otherwise, the top element of // the stack is returned. void pop(); linkedStackType(); //Postcondition: stackTop = NULL; linkedStackType(const…
stacktype.h stacktype.cPP #ifndef STACKTYPE_H_INCLUDED tdefine STACKTYPE H_INCLUDED #include "StackType.h" template StackType::StackType () const int MAX_ITEMS - 5; top - -1; class Fulistack // Exception class thrown // by Push when stack is full. template bool StackType: :IsEmpty () class EmptyStack // Exception class thrown // by Pop and Top when stack is emtpy. return (top = -1); template bool StackType: :ISFull () template class StackType return (top -- MAX_ITEMS-1): template void StackType: :Push (ItemType newItem) public: StackType () : bool IsFull (): bool IsEmpty (): void Push (ItemType); void Pop () i if( IsFull ()) throw Fullstack (); top++: items (top]- newItem; template void StackType:: Pop () ItemType Top (): private: int top: ItemType items [MAX_ITEMS ]; if( IsEmpty ()) throw EmptyStack (); top-- }; tendif // STACKTYPE_H_INCLUDED template ItemType StackType::Top () if (IsEmpty ()) throw Emptystack (): return items [top]; Generate the driver file (main.cpp) where…
Programming Language: C++ I need the codes for arrayListType.h, main.cpp, myString.cpp, myString.h
#include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef struct LINKED_STACK_NODE_s{LINKED_STACK_NODE next;void *data;} LINKED_STACK_NODE_t[1]; typedef struct LINKED_STACK_s{LINKED_STACK_NODE head;int count;} LINKED_STACK_t[1], *LINKED_STACK; typedef struct{int R;int C;} POS_t[1], *POS; LINKED_STACK stack_init();void stack_free(LINKED_STACK stack);void stack_push(LINKED_STACK stack, void *data);void *stack_pop(LINKED_STACK stack);void *stack_top(LINKED_STACK stack);int is_empty(LINKED_STACK stack); int is_empty(LINKED_STACK stack){return stack->head == NULL;} LINKED_STACK stack_init(){LINKED_STACK stack = (LINKED_STACK)malloc(sizeof(LINKED_STACK_t));if (stack == NULL){printf("\nproblem with initializing stack\n\n");return NULL;}stack->head = NULL;stack->count = 0;return stack;} void stack_free(LINKED_STACK stack){while (is_empty(stack) == 0){stack_pop(stack);}free(stack);}void…
C++ ProgrammingActivity: Linked List Stack and BracketsExplain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow #include "stack.h" #include "linkedlist.h" // SLLStack means Singly Linked List (SLL) Stack class SLLStack : public Stack { LinkedList* list; public: SLLStack() { list = new LinkedList(); } void push(char e) { list->add(e); return; } char pop() { char elem; elem = list->removeTail(); return elem; } char top() { char elem; elem = list->get(size()); return elem; } int size() { return list->size(); } bool isEmpty() { return list->isEmpty(); } };
C++ program LinkList: namespace { template<typename T> class List { public: virtual ~List(){}; virtual bool addFirst(T) = 0; virtual bool addLast(T) = 0; virtual T& get(int) = 0; virtual bool insert(int, T) = 0; virtual T remove(int) = 0; virtual T removeFirst() = 0; virtual T removeLast() = 0; virtual void set(int, T) = 0; virtual int size() const = 0; }; } #endif //PROG1_LIST_H
Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…
#include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef struct LINKED_STACK_NODE_s{LINKED_STACK_NODE next;void *data;} LINKED_STACK_NODE_t[1]; typedef struct LINKED_STACK_s{LINKED_STACK_NODE head;int count;} LINKED_STACK_t[1], *LINKED_STACK; typedef struct{int R;int C;} POS_t[1], *POS; LINKED_STACK stack_init();void stack_free(LINKED_STACK stack);void stack_push(LINKED_STACK stack, void *data);void *stack_pop(LINKED_STACK stack);void *stack_top(LINKED_STACK stack);int is_empty(LINKED_STACK stack); int is_empty(LINKED_STACK stack){return stack->head == NULL;} LINKED_STACK stack_init(){LINKED_STACK stack = (LINKED_STACK)malloc(sizeof(LINKED_STACK_t));if (stack == NULL){printf("\nproblem with initializing stack\n\n");return NULL;}stack->head = NULL;stack->count = 0;return stack;} void stack_free(LINKED_STACK stack){while (is_empty(stack) == 0){stack_pop(stack);}free(stack);}void…
main.cc file #include <iostream>#include <memory> #include "train.h" int main() { // Creates a train, with the locomotive at the front of the train. // LinkedList diagram: // Locomotive -> First Class -> Business Class -> Cafe Car -> Carriage 1 -> // Carriage 2 std::shared_ptr<Train> carriage2 = std::make_shared<Train>(100, 100, nullptr); std::shared_ptr<Train> carriage1 = std::make_shared<Train>(220, 220, carriage2); std::shared_ptr<Train> cafe_car = std::make_shared<Train>(250, 250, carriage1); std::shared_ptr<Train> business_class = std::make_shared<Train>(50, 50, cafe_car); std::shared_ptr<Train> first_class = std::make_shared<Train>(20, 20, business_class); std::shared_ptr<Train> locomotive = std::make_shared<Train>(1, 1, first_class); std::cout << "Total passengers in the train: "; // =================== YOUR CODE HERE…
C++ Question You need to write a class called LinkedList that implements the following List operations: public void add(int index, Object item); // adds an item to the list at the given index, that index may be at start, end or after or before the // specific element 2.public void remove(int index); // removes the item from the list that has the given index 3.public void remove(Object item); // finds the item from list and removes that item from the list 4.public List duplicate(); // creates a duplicate of the list // postcondition: returns a copy of the linked list 5.public List duplicateReversed(); // creates a duplicate of the list with the nodes in reverse order // postcondition: returns a copy of the linked list with the nodes in 6.public List ReverseDisplay(); //print list in reverse order 7.public Delete_Smallest(); // Delete smallest element from linked list 8.public List Delete_duplicate(); // Delete duplicate elements from a given linked list.Retain the…
C++ Question You need to write a class called LinkedList that implements the following List operations: public void add(int index, Object item); // adds an item to the list at the given index, that index may be at start, end or after or before the // specific element 2.public void remove(int index); // removes the item from the list that has the given index 3.public void remove(Object item); // finds the item from list and removes that item from the list 4.public List duplicate(); // creates a duplicate of the list // postcondition: returns a copy of the linked list 5.public List duplicateReversed(); // creates a duplicate of the list with the nodes in reverse order // postcondition: returns a copy of the linked list with the nodes in 6.public List ReverseDisplay(); //print list in reverse order 7.public Delete_Smallest(); // Delete smallest element from linked list 8.public List Delete_duplicate(); // Delete duplicate elements from a given linked list.Retain the…
Course: Data Structure and Algorithms Language: C++ Question is well explained Question #2Implement a class for Circular Doubly Linked List (with a dummy header node) which stores integers in unsorted order. Your class definitions should look like as shown below: class CDLinkedList;class DNode {friend class CDLinkedList;private int data;private DNode next;private DNode prev;};class CDLinkedList {private:DNode head; // Dummy header nodepublic CDLinkedList(); // Default constructorpublic bool insert (int val); public bool removeSecondLastValue (); public void findMiddleValue(); public void display(); };