Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + (p * q + r ) * s, Follow general precedence rule and suppose that the expression is legal.                                                                                         

Ans.

The given infix expression is as follows :-

x + y * z + (p * q + r) * s

Symb                Stack                    Postfix Expression x empty  x

+                       +                           x

y                       +                           xy

*                       +*                         xy

z                       +*                         xyz

+                       +                           xyz*+ (          +(         xyz*+

p                       +(                         xyz*+p

*                       +(*                       xyz*+p q       +(*       xyz*+p

+                       +(+                       xyz*+pq*

r                        +(+                       xyz*+pq*r

)                        +                           xyz*+pq*r+

*                       +*                         xyz*+pq*r+

s                        +*                         xyz*+pq*r+s

= xyz*+pq*r+s*+ The postfix expression obtained  is :- xyz*+pq*r+s*+

Posted Date: 7/12/2012 8:34:32 AM | Location : United States

Ask an Expert

Related Discussions:- Infix expression to postfix form using the stack function, Assignment Help, Ask Question on Infix expression to postfix form using the stack function, Get Answer, Expert's Help, Infix expression to postfix form using the stack function Discussions

Write discussion on Infix expression to postfix form using the stack function
Your posts are moderated

Write your message here..

Related Questions

Explain about hubs, Hubs - In reality a multiport repeater - Connect... Hubs - In reality a multiport repeater - Connects stations in a physical star topology - As well may create multiple levels of hierarchy to remove length limitation of 10

Nonrecursive implementation of a recursive algorithm?, What data structure ... What data structure would you mostly likely see in a nonrecursive execution of a recursive algorithm? Stack

Compare two functions, Comp are two functions n 2    and  2 n  / 4... Comp are two functions n 2    and  2 n  / 4  for distinct values of n.   Determine When s ec on d function b ec om es l a r g er th an f i r st functi

B-TREE and AVL tree diffrance, Explain process of B-TREE and what differen... Explain process of B-TREE and what difference between AVL Tree Using Algorithms

Tower of hanoi, how do we use 4-discs stack to solve tower of hanoi problem... how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?

An undirected graph g with n vertices and e edges, An undirected graph G wi... An undirected graph G with n vertices and e edges is shown by adjacency list.  What is the time required to generate all the connected components? O (e+n)

Algorithm for binary search, Q. Write down the algorithm for binary search.... Q. Write down the algorithm for binary search. Which are the conditions under which sequential search of a list is preferred over the binary search?

Define graph, A graph is a mathematical structure giving of a set of vertex... A graph is a mathematical structure giving of a set of vertexes (v1, v2, v3) and a group of edges (e1, e2, e3). An edge is a set of vertexes. The two vertexes are named the edge en

Functions for inserting and deleting at either end of deque, Q. Devise a re... Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu

Complexity of a program, how to calculate complexity of a program how to calculate complexity of a program