HomeworkLib
Question

Java Evaluate whether the parentheses are balanced. { a * [ b - c ] /...

Java

Evaluate whether the parentheses are balanced.

{ a * [ b - c ] / [ d + e ]

a:closed parenthesis left on the stack

b:none of these is correct

c:open parenthesis left on the stack

d:mismatch found when popping from the stack

e:empty stack and no more tokens

f:empty stack with no match for a close parenthesis

( a { b + c } + [ d * e ] - f ) / g ]

a:empty stack and no more tokens

b:none of these is correct

c:mismatch found when popping from the stack

d:closed parenthesis left on the stack

e:empty stack with no match for a close parenthesis

f:open parenthesis left on the stack

a [ b [ c - d ] * e + { f / g } ) + h

a:none of these is correct

b:empty stack and no more tokens

c:mismatch found when popping from the stack

d:empty stack with no match for a close parenthesis

e:closed parenthesis left on the stack

f:open parenthesis left on the stack

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1 
1)  c:open parenthesis left on the stack
2)  e:empty stack with no match for a close parenthesis
3)  c:mismatch found when popping from the stack

0 0
Add a comment
Know the answer?
Add Answer to:
Java Evaluate whether the parentheses are balanced. { a * [ b - c ] /...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Problem Implement (in C) an algorithm that uses a stack to check if a parentheses sequence is balanced. Note that a par...

    Problem Implement (in C) an algorithm that uses a stack to check if a parentheses sequence is balanced. Note that a parentheses sequence is balanced if it is of the form (S) or of the form (SS), where S is any balanced parentheses sequence. See the courseware for more information on balanced parentheses sequences. Implement a stack using an array Test your program on three different kinds of inputs: 1. String is unbalanced in the sense that there are more...

  • One application of stacks is to keep track of things that must match up such as...

    One application of stacks is to keep track of things that must match up such as parentheses in an expression or braces in a program. In the case of parentheses when a left parenthesis is encountered it is pushed on the stack and when a right parenthesis is encountered its matching left parenthesis is popped from the stack. If the stack has no left parenthesis, that means the parentheses don’t match—there is an extra right parenthesis. If the expression ends...

  • 2. Check for balanced parentheses in an expression using a stack. Given the expression string below,...

    2. Check for balanced parentheses in an expression using a stack. Given the expression string below, examine whether the pairs and the orders of "" "" ""are correct. Show the stack each time it is modified a'(b-c\/[[3-d}"(4+911

  • C++ Include a Stack class but DO NOT use STL stack, do not sumbit code that...

    C++ Include a Stack class but DO NOT use STL stack, do not sumbit code that is similar to www.cplusplus.com/forum/beginner/192479/ Parenthesis Balance Problem Description Compilers require parenthesis, braces, brackets, and angled brackets to be balanced. This means that every time one is opened it must also be close AND everything between the two are also balanced. Balanced: (00) oO100) (C0O Unbalanced: (DI This is easily determined by creating a stack and reading the input. When an open parenthesis is found,...

  • Multiple choice data structures questions about stacks. Here is an INCORRECT pseudocode for the algorithm which...

    Multiple choice data structures questions about stacks. Here is an INCORRECT pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced: declare a character stack while ( more input is available) { read a character if ( the character is a '(' ) push it on the stack else if ( the character is a ')' and the stack is not empty ) pop a character off the stack else print "unbalanced" and exit...

  • PLEASE HURRY! I only have 30 minutes for these questions. thank you! Following is an incorrect...

    PLEASE HURRY! I only have 30 minutes for these questions. thank you! Following is an incorrect pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced: declare a character stack while ( more input is available) read a character if ( the character is a) push it on the stack pop a character off the stack print "unbalanced" and exit else if ( the character is a ')' and the stack is not empty)...

  • 5) Consider the following Java statements, assuming that MyStack is a class that implements the interface...

    5) Consider the following Java statements, assuming that MyStack is a class that implements the interface StackInterface : int n = 4; StackInterface stack = new MyStack<>(); while (n > 0) { stack.push(n); n--; } // end while int result = 1; while (!stack.isEmpty()) { int integer = stack.pop(); result = result * integer; } // end while System.out.println("result = " + result); a.) What value is displayed when this code executes? b.) What mathematical function does the code evaluate?...

  • Please use Java. Write a non-recursive method that uses a stack to check whether its string...

    Please use Java. Write a non-recursive method that uses a stack to check whether its string parameter is a palindrome. Write a program to test and demo your method. Fibonacci Numbers Write a method that uses a stack to determine the desired Fibonacci number. Write a program to test and demo your method. Balancing Grouping Symbols Write a method that takes a string parameter and determines whether the string contains matching grouping symbols. Grouping symbols are parenthesis ( ), curly...

  • C++ Language 1. Match the related concepts.       -       A.       B....

    C++ Language 1. Match the related concepts.       -       A.       B.       C.       D.       E.       F.    recursion       -       A.       B.       C.       D.       E.       F.    new       -       A.       B.       C.       D.       E.       F.    main       -   ...

  • JAVA, please You must write a robust program meaning that your program should not crash with...

    JAVA, please You must write a robust program meaning that your program should not crash with any given data. Data validation must be done any time that user enters an input. Write a program that 1. Gets an infix expression form the user and evaluate the expression using stack ADT a. Finds the postfix equivalent of the given infix expression b. Evaluate the created postfix expression. c. Note: your program should not crash when you enter an invalid expression such...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT