Evaluating Postfix - Data Stuctures - Lecture Slides, Slides of Data Structures and Algorithms

Evaluating Postfix, Infix to Postfix, Converting Infix to Postfix, Handling parenthesis, Previous two operands, Top of the stack, Postfix forms, Back on the stack are key points of this lecture. and you can learn some other data structure terms.

Typology: Slides

2011/2012

Uploaded on 11/03/2012

ekna
ekna ๐Ÿ‡ฎ๐Ÿ‡ณ

4.2

(5)

75 documents

1 / 35

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Infix to Postfix
Infix Postfix
A + B A B +
12 + 60 โ€“ 23 12 60 + 23 โ€“
(A + B)*(C โ€“ D ) A B + C D โ€“ *
A โ†‘ B * C โ€“ D + E/F A B โ†‘ C*D โ€“ E F/+
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23

Partial preview of the text

Download Evaluating Postfix - Data Stuctures - Lecture Slides and more Slides Data Structures and Algorithms in PDF only on Docsity!

Infix to Postfix

Infix Postfix

A + B A B +

(A + B)*(C โ€“ D ) A B + C D โ€“ *

A โ†‘ B * C โ€“ D + E/F A B โ†‘ C*D โ€“ E F/+

Infix to Postfix

๏‚ง Note that the postfix form an expression

does not require parenthesis.

๏‚ง Consider โ€˜4+35โ€™ and โ€˜(4+3)5โ€™. The

parenthesis are not needed in the first but

they are necessary in the second.

๏‚ง The postfix forms are:

Stack s;

while( not end of input ) {

e = get next element of input

if( e is an operand )

s.push( e );

else {

op2 = s.pop();

op1 = s.pop();

value = result of applying operator โ€˜eโ€™ to op1 and op2;

s.push( value );

finalresult = s.pop();

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack 6 6

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack 6 6 2 6, 3 6,2,

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack 6 6 2 6, 3 6,2,

  • 2 3 5 6,

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack 6 6 2 6, 3 6,2,

  • 2 3 5 6,
  • 6 5 1 1 3 6 5 1 1,

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack 6 6 2 6, 3 6,2,

  • 2 3 5 6,
  • 6 5 1 1 3 6 5 1 1, 8 6 5 1 1,3,

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack 6 6 2 6, 3 6,2,

  • 2 3 5 6,
  • 6 5 1 1 3 6 5 1 1, 8 6 5 1 1,3, 2 6 5 1 1,3,8, / 8 2 4 1,3,

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack 6 6 2 6, 3 6,2,

  • 2 3 5 6,
  • 6 5 1 1 3 6 5 1 1, 8 6 5 1 1,3, 2 6 5 1 1,3,8, / 8 2 4 1,3,
  • 3 4 7 1,

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack

Evaluate 6 2 3 + - 3 8 2 / + * 2 โ†‘ 3 +

Input op1 op2 value stack

  • 2 6,
  • 3 6,2,
    • 2 3 5 6,
  • 3 6 5 1 1,
  • 8 6 5 1 1,3,
  • 2 6 5 1 1,3,8,
  • / 8 2 4 1,3,
    • 3 4 7 1,
  • 2 6,
  • 3 6,2,
    • 2 3 5 6,
  • 3 6 5 1 1,
  • 8 6 5 1 1,3,
  • 2 6 5 1 1,3,8,
  • / 8 2 4 1,3,
    • 3 4 7 1,
  • 2 1 7 7 7,
  • 2 6,
  • 3 6,2,
    • 2 3 5 6,
  • 3 6 5 1 1,
  • 8 6 5 1 1,3,
  • 2 6 5 1 1,3,8,
  • / 8 2 4 1,3,
    • 3 4 7 1,
  • 2 1 7 7 7,
  • โ†‘
  • 2 6,
  • 3 6,2,
    • 2 3 5 6,
  • 3 6 5 1 1,
  • 8 6 5 1 1,3,
  • 2 6 5 1 1,3,8,
  • / 8 2 4 1,3,
    • 3 4 7 1,
  • 2 1 7 7 7,
  • โ†‘
  • 3 7 2 49 49,
  • 2 6,
  • 3 6,2,
    • 2 3 5 6,
  • 3 6 5 1 1,
  • 8 6 5 1 1,3,
  • 2 6 5 1 1,3,8,
  • / 8 2 4 1,3,
    • 3 4 7 1,
  • 2 1 7 7 7,
  • โ†‘
  • 3 7 2 49 49,
  • 2 6,
  • 3 6,2,
    • 2 3 5 6,
  • 3 6 5 1 1,
  • 8 6 5 1 1,3,
  • 2 6 5 1 1,3,8,
  • / 8 2 4 1,3,
    • 3 4 7 1,
  • 2 1 7 7 7,
  • โ†‘
  • 3 7 2 49 49,