Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Question
100%

Create an Java Postfix converter using the algorithm provided.

Thank you

 

Algorithm convertToPostfix (infix)
11 Converts an infix expression to an equivalent postfix expression.
operatorStack = a new empty stack
postfix = a new empty string
while (infix has characters left to parse)
{
nextCharacter = next nonblank character of infix
switch (nextCharacter)
{
}
}
while
{
case variable:
Append nextCharacter to postfix
break
case 'Λ'
operatorStack.push(nextCharacter)
break
case '+': case
: case
while (!operatorStack.isEmpty() and
precedence of nextCharacter <= precedence of operatorStack.peek ())
Append operatorStack. peek () to postfix
operatorStack.pop()
{
}
break
case '(':
I
operatorStack.push(nextCharacter)
I* I
operatorStack.push(nextCharacter)
break
case ')': // Stack is not empty if infix expression is valid
operatorStack.pop()
=
topOperator
while (topOperator != '(')
{
: case '/' :
Append topOperator to postfix
topOperator = operatorStack.pop()
(!operatorStack.isEmpty())
}
break
default: break // Ignore unexpected characters
}
return postfix
topOperator = operatorStack.pop()
Append topOperator to postfix
expand button
Transcribed Image Text:Algorithm convertToPostfix (infix) 11 Converts an infix expression to an equivalent postfix expression. operatorStack = a new empty stack postfix = a new empty string while (infix has characters left to parse) { nextCharacter = next nonblank character of infix switch (nextCharacter) { } } while { case variable: Append nextCharacter to postfix break case 'Λ' operatorStack.push(nextCharacter) break case '+': case : case while (!operatorStack.isEmpty() and precedence of nextCharacter <= precedence of operatorStack.peek ()) Append operatorStack. peek () to postfix operatorStack.pop() { } break case '(': I operatorStack.push(nextCharacter) I* I operatorStack.push(nextCharacter) break case ')': // Stack is not empty if infix expression is valid operatorStack.pop() = topOperator while (topOperator != '(') { : case '/' : Append topOperator to postfix topOperator = operatorStack.pop() (!operatorStack.isEmpty()) } break default: break // Ignore unexpected characters } return postfix topOperator = operatorStack.pop() Append topOperator to postfix
Expert Solution
Check Mark
Still need help?
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Can a test class be added to the program?

Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Follow-up Question

Can you provide further comments explaining the functionality of what each line of code is doing? I know its a lot but it helps me learn.Thank you

Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Can a test class be added to the program?

Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Follow-up Question

Can you provide further comments explaining the functionality of what each line of code is doing? I know its a lot but it helps me learn.Thank you

Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Knowledge Booster
Background pattern image
Computer Science
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
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education