Discuss the advantages of expression tree, Computer Engineering

Assignment Help:

Discuss its advantages over the other evaluation techniques.

The expression tree is determined by using a post-order traversal of the expression tree as given here:
1. If such node has no children, this must return the value of the node
2. Calculate the left hand child
3. Calculate the right hand child
4. Then calculate the operation indicated through the node and return this value
An expression tree is advantageous for:

Understanding the sequence of operation. Operations which must be completed sooner are further to the right in the tree.
Counting the no. of terms or factors in an expression. All terms or factor is a child node. For illustration the expression (a+b)/c+2*d contains two terms.

Related Discussions:- Discuss the advantages of expression tree

Design issues of interconnection network, Design Issues Of Interconnection ...

Design Issues Of Interconnection Network The following are the problems, which should be considered while preparing an interconnection network. 1) Dimension and size of n

How can i handle floating-point exceptions gracefully, 'On many systems, yo...

'On many systems, you can describe a function matherr which will be known as when there are certain floating-point errors, like errors in the math routines in .

Explain the virtual memory, In computing, virtual memory is a memory manage...

In computing, virtual memory is a memory management method developed for multitasking kernels. This technique virtualizes computer architecture's various forms of computer data sto

Briefly define the term isotype, Question: (a) (i) Briefly define the t...

Question: (a) (i) Briefly define the term "Isotype". (ii) With the help of diagrams, describe the rules of "Isotype". (b) Elaborate on your understanding of internationa

Show the steps of execution of instructions, Q. Show the steps of execution...

Q. Show the steps of execution of instructions? Fetch First Instruction into CPU: Step 1: Find/calculate the address of first instruction in memory. In this machine illust

What are multi-cycle paths, What are multi-cycle paths? Multi-cycle pat...

What are multi-cycle paths? Multi-cycle paths are paths among registers which take more than one clock cycle to turn out to be stable. For illustration analyzing the de

Queue, A Queue is a FIFO (rst in, rst out) data structure. Given the foll...

A Queue is a FIFO (rst in, rst out) data structure. Given the following queue interface: public interface Queue { int size(); // current queue size boolean isEmpty(); //

What is open addressing, Open addressing: The easiest way to resolve a co...

Open addressing: The easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty location. The idea is to place the

What are the types of data warehouses, What are the types of data warehouse...

What are the types of data warehouses? Various types of data warehouses are illustrated below: a) Financial Data Warehouses b) Insurance Data Warehouses c) Human Resou

Explain the message passing interface, Q. Explain the Message Passing Inter...

Q. Explain the Message Passing Interface? The Message Passing Interface (MPI) is a universal benchmark for providing communication among multiple simultaneous processes on a di

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages