Write a program that uses stacks to evaluate an arithmetic expression in infix notation without converting it into postfix notation. The program takes as input a numeric expression in infix notation, such as 3+4*2, and outputs the result. 1) Operators are +, -, *, / 2) Assume that the expression is formed correctly so that each operation has two arguments. 3) The expression can have parenthesis, for example: 3*(4-2)+6. 4) The expression can have negative numbers. 5) The expression can have spaces in it, for example: 3* (4-2) +6. Here are some useful functions that you may need: char cin.peek(); -- returns the next character of the cin input stream (without reading it) bool isdigit(char c); -- returns true if c is one of the digits '0' through '9', false otherwise cin.ignore(); -- reads and discards the next character from the cin input stream cin.get(char &c); -- reads a character in c ( could be a space or the new line)

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Write a program that uses stacks to evaluate an arithmetic expression in infix notation without converting it into postfix notation.

 

The program takes as input a numeric expression in infix notation, such as 3+4*2, and outputs the result.

 

1)   Operators are +, -, *, /

2)   Assume that the expression is formed correctly so that each operation has two arguments.

3)  The expression can have parenthesis, for example: 3*(4-2)+6.

4)  The expression can have negative numbers.

5)  The expression can have spaces in it, for example: 3  *  (4-2)  +6 .

 

Write a program that uses stacks to evaluate an arithmetic expression in infix notation without converting it
into postfix notation.
The program takes as input a numeric expression in infix notation, such as 3+4*2, and outputs the result.
1) Operators are +, -, *, /
2) Assume that the expression is formed correctly so that each operation has two arguments.
3) The expression can have parenthesis, for example: 3*(4-2)+6.
4) The expression can have negative numbers.
5) The expression can have spaces in it, for example: 3* (4-2) +6.
Here are some useful functions that you may need:
char cin.peek(); -- returns the next character of the cin input stream (without reading it)
bool isdigit(char c); -- returns true if c is one of the digits '0' through '9', false otherwise
cin.ignore(); -- reads and discards the next character from the cin input stream
cin.get(char &c); -- reads a character in c ( could be a space or the new line)
Transcribed Image Text:Write a program that uses stacks to evaluate an arithmetic expression in infix notation without converting it into postfix notation. The program takes as input a numeric expression in infix notation, such as 3+4*2, and outputs the result. 1) Operators are +, -, *, / 2) Assume that the expression is formed correctly so that each operation has two arguments. 3) The expression can have parenthesis, for example: 3*(4-2)+6. 4) The expression can have negative numbers. 5) The expression can have spaces in it, for example: 3* (4-2) +6. Here are some useful functions that you may need: char cin.peek(); -- returns the next character of the cin input stream (without reading it) bool isdigit(char c); -- returns true if c is one of the digits '0' through '9', false otherwise cin.ignore(); -- reads and discards the next character from the cin input stream cin.get(char &c); -- reads a character in c ( could be a space or the new line)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY