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

Explain about computer architecture, Explain about Computer architecture ...

Explain about Computer architecture Computer architecture is the conceptual design and fundamental operational structure of a computer system. It is a blueprint and functional

.bus, clasification of bus

clasification of bus

Expalin the history of parallel computers, Expalin the History Of Parallel ...

Expalin the History Of Parallel Computers The researches with and implementations of use of the parallelism started long back in the 1950's by IBM Corporation. The IBM STRETCH

Rubber band interactive picture construction technique, dear sir,kindly des...

dear sir,kindly describe the above tpoic completely

Microprocessors and interfaces, #question.write cycle timing diagram for ma...

#question.write cycle timing diagram for maximum mode of 8086 microprocessor.

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

Register data type as sequential element, Reg data type as Sequential eleme...

Reg data type as Sequential element module reg_seq_example( clk, reset, d, q); input clk, reset, d; output q; reg q; wire clk, reset, d; always @ (posedge clk or

Explain mutual-exclusion implementation with semaphores, Disadvantage and...

Disadvantage and Advantage of mutual-exclusion implementation with semaphores. Disadvantage: Mutual-exclusion solutions specified by semaphores require busy waiting. Tha

Design a nand-to-and gate network, Q Use as few gates as possible, design a...

Q Use as few gates as possible, design a NAND-to-AND gate network that realize the following Boolean algebra expression. ABCD + A'BC'D + A'BC'D' + A'BCD + (A'B'C'D' + A'BCD')

Illustrated three stages of data mining process, Illustrated three stages o...

Illustrated three stages of data mining process? Stage 1: Exploration: This stage generally starts along with data preparation that may involve cleaning data, selecting subse

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages