Customer Service Chat
Get quote & make Payment
Expression Tree, Programming Languages
For this assignment you will read a file expression.txt and create an expression tree. The expression will be a valid infix expression with the all the necessary parentheses so that there is no ambiguity in the order of the expression. You will evaluate the expression and print the result. You will also write the prefix and postfix versions of the same expression without any parentheses.
In an expression tree the nodes are either operators or operands. The operators will be in the set [''+'', ''-'', ''*'', ''/'']. The operands will be either integers or floating point numbers. All the operand nodes will be leaves of the expression tree. All the operator nodes will have exactly two children.
The outline of your program will be as follows:
class Stack (object):
class Node (object):
class Tree (object):
def __init__ (self):
def createTree (self, expr):
def evaluate (self, aNode):
def preOrder (self, aNode):
def postOrder (self, aNode):
The function createTree() will take as input parameter an infix expression with parentheses as a String and create an Expression Tree from it. Assume that the expression string is valid.
You will take the expression string and break it into tokens. There are four different kinds of tokens - left parenthesis, right parenthesis, operator, and operand. When we read a left parenthesis we are starting a new expression and when we read a right parenthesis we are ending an expression. Here is the algorithm that you will use:
If the current token is a left parenthesis add a new node as the left child of the current node. Push current node on the stack and make current node equal to the left child.
If the current token is an operator set the current node''s data value to the operator. Push current node on the stack. Add a new node as the right child of the current node and make the current node equal to the right child.
If the current token is an operand, set the current node''s data value to the operand and make the current node equal to the parent by popping the stack.
If the current token is a right parenthesis make the current node equal to the parent node by popping the stack if it is not empty.
For the input file this is what your program will output:
( ( 8 + 3 ) * ( 7 - 2 ) ) = 55
Prefix Expression: * + 8 3 - 7 2
Postfix Expression: 8 3 + 7 2 - *
Posted Date: 4/20/2012 9:52:36 AM | Location : United States
Ask an Expert
Expression Tree, Assignment Help, Ask Question on Expression Tree, Get Answer, Expert's Help, Expression Tree Discussions
Write discussion on Expression Tree
Your posts are moderated
Write your message here..
Python , Write a script that will list and count all of the images in a giv...
Write a script that will list and count all of the images in a given HTML web page. Each image starts with
Advantages of asp.net mvc framework, Advantages of asp.net mvc framework ...
Advantages of asp.net mvc framework MVC is a conventional style design that many designers are acquainted with. Some kinds of Web programs will advantage from the MVC structur
Count no of files, Normal 0 false false false EN-US X...
Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4
Software architecture, Select two different architecture styles to design a...
Select two different architecture styles to design and implement a software system and provide its Architecture Diagrams (implement the software with java)
Language processors, explain steps of program execution in language process...
explain steps of program execution in language processors
Create single page to demonstrates an xhtml form, Create a single page that...
Create a single page that demonstrates an XHTML form. The form should include all the fields you feel are necessary for submitting an order of books and must include at least one
Code html and xml, Topic Develop a Web site that will provide informat...
Topic Develop a Web site that will provide information about your organization. The Web site will need to have a user-friendly interface for users to enter their information;
Padovan string, Padovan String Problem Description A Padovan string...
Padovan String Problem Description A Padovan string P(n) for a natural number n is defined as: P(0) = 'X' P(1) = 'Y' P(2) = 'Z' P(n) = P(n-2) + P(n-3), n
Define parameter passing mechanism - computer programming, Define the Param...
Define the Parameter Passing Mechanism - Computer Programming? The Parameters are syntactically identifiers and they are used within the body of the function and sometimes the
What is CAI Explain its pitfalls, What is CAI Explain its pitfalls
What is CAI Explain its pitfalls
Accounting Assignment Help
Economics Assignment Help
Finance Assignment Help
Statistics Assignment Help
Physics Assignment Help
Chemistry Assignment Help
Math Assignment Help
Biology Assignment Help
English Assignment Help
Management Assignment Help
Engineering Assignment Help
Programming Assignment Help
Computer Science Assignment Help
Why Us ?
~24x7 hrs Support
~Quality of Work
~Time on Delivery
~Privacy of Work
Human Resource Management
Literature Review Writing Help
Follow Us |
T & C
Copyright by ExpertsMind IT Educational Pvt. Ltd.