Scribd Logo
Upload

Welcome to Scribd!

  • 101 views

    In Fix To Post Fix Examples

    Uploaded by

    Sami Abdelgadir Mohammed
    The document describes the process for converting expressions in infix notation to postfix notation. It explains that operands are output directly and operators are pushed onto a stack. When an operator is encountered, lower precedence operators are popped off the stack first. Opening parentheses are pushed and closing parentheses trigger popping until the matching opening parentheses is found. Three examples are shown step-by-step to demonstrate the algorithm.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    In Fix To Post Fix Examples

    Uploaded by

    Sami Abdelgadir Mohammed
    101 views72 pages
    The document describes the process for converting expressions in infix notation to postfix notation. It explains that operands are output directly and operators are pushed onto a stack. When an operator is encountered, lower precedence operators are popped off the stack first. Opening parentheses are pushed and closing parentheses trigger popping until the matching opening parentheses is found. Three examples are shown step-by-step to demonstrate the algorithm.

    Original Description:

    In Fix to Post Fix Examples calculator

    Original Title

    In Fix to Post Fix Examples

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes the process for converting expressions in infix notation to postfix notation. It explains that operands are output directly and operators are pushed onto a stack. When an operator is encountered, lower precedence operators are popped off the stack first. Opening parentheses are pushed and closing parentheses trigger popping until the matching opening parentheses is found. Three examples are shown step-by-step to demonstrate the algorithm.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    101 views72 pages

    In Fix To Post Fix Examples

    Uploaded by

    Sami Abdelgadir Mohammed
    The document describes the process for converting expressions in infix notation to postfix notation. It explains that operands are output directly and operators are pushed onto a stack. When an operator is encountered, lower precedence operators are popped off the stack first. Opening parentheses are pushed and closing parentheses trigger popping until the matching opening parentheses is found. Three examples are shown step-by-step to demonstrate the algorithm.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 72

    Data Structures and Algorithms

    V22.0102
    Otvio Braga

    Infix to Postfix Conversion


    We use a stack
    When an operand is read, output it
    When an operator is read
    Pop until the top of the stack has an element of lower
    precedence
    Then push it

    When ) is found, pop until we find the matching (


    ( has the lowest precedence when in the stack
    but has the highest precedence when in the input
    When we reach the end of input, pop until the stack is
    empty

    Infix to Postfix Conversion


    Example 1
    3+4*5/6

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack:
    Output:

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack:
    Output: 3

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack: +
    Output: 3

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack: +
    Output: 3 4

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack: + *
    Output: 3 4

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack: + *
    Output: 3 4 5

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack: +
    Output: 3 4 5 *

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack: + /
    Output: 3 4 5 *

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack: + /
    Output: 3 4 5 * 6

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack: +
    Output: 3 4 5 * 6 /

    Infix to Postfix Conversion


    Example 1
    3+4*5/6
    Stack:
    Output: 3 4 5 * 6 / +
    Done!

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack:
    Output:

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: (
    Output:

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: (
    Output: 300

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: ( +
    Output: 300

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: ( +
    Output: 300 23

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: (
    Output: 300 23 +

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack:
    Output: 300 23 +

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: *
    Output: 300 23 +

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: * (
    Output: 300 23 +

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: * (
    Output: 300 23 + 43

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: * ( Output: 300 23 + 43

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: * ( Output: 300 23 + 43 21

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: * (
    Output: 300 23 + 43 21 -

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: *
    Output: 300 23 + 43 21 -

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack:
    Output: 300 23 + 43 21 - *

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: /
    Output: 300 23 + 43 21 - *

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: / (
    Output: 300 23 + 43 21 - *

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: / (
    Output: 300 23 + 43 21 - * 84

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: / ( +
    Output: 300 23 + 43 21 - * 84

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: / ( +
    Output: 300 23 + 43 21 - * 84 7

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: / (
    Output: 300 23 + 43 21 - * 84 7 +

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack: /
    Output: 300 23 + 43 21 - * 84 7 +

    Infix to Postfix Conversion


    Example 2
    (300+23)*(43-21)/(84+7)
    Stack:
    Output: 300 23 + 43 21 - * 84 7 + /
    Done!

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack:
    Output:

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: (
    Output:

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: (
    Output: 4

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: ( +
    Output: 4

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: ( +
    Output: 4 8

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: (
    Output: 4 8 +

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack:
    Output: 4 8 +

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: *
    Output: 4 8 +

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: * (
    Output: 4 8 +

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: * (
    Output: 4 8 + 6

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: * ( Output: 4 8 + 6

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: * ( Output: 4 8 + 6 5

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: * (
    Output: 4 8 + 6 5 -

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: *
    Output: 4 8 + 6 5 -

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack:
    Output: 4 8 + 6 5 - *

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: /
    Output: 4 8 + 6 5 - *

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / (
    Output: 4 8 + 6 5 - *

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( (
    Output: 4 8 + 6 5 - *

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( (
    Output: 4 8 + 6 5 - * 3

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( ( Output: 4 8 + 6 5 - * 3

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( ( Output: 4 8 + 6 5 - * 3 2

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( (
    Output: 4 8 + 6 5 - * 3 2 -

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / (
    Output: 4 8 + 6 5 - * 3 2 -

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( *
    Output: 4 8 + 6 5 - * 3 2 -

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( * (
    Output: 4 8 + 6 5 - * 3 2 -

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( * (
    Output: 4 8 + 6 5 - * 3 2 - 2

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( * ( +
    Output: 4 8 + 6 5 - * 3 2 - 2

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( * ( +
    Output: 4 8 + 6 5 - * 3 2 2 2

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( * (
    Output: 4 8 + 6 5 - * 3 2 2 2 +

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / ( *
    Output: 4 8 + 6 5 - * 3 2 2 2 +

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: / (
    Output: 4 8 + 6 5 - * 3 2 2 2 + *

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack: /
    Output: 4 8 + 6 5 - * 3 2 2 2 + *

    Infix to Postfix Conversion


    Example 3
    (4+8)*(6-5)/((3-2)*(2+2))
    Stack:
    Output: 4 8 + 6 5 - * 3 2 2 2 + * /
    Done!

    You might also like