Scribd Logo
Încărcați

Bine ați venit la Scribd!

  • Infix

    Încărcat de

    Jayachandra Jc
    5 vizualizări2 pagini
    The document shows the steps to evaluate two infix expressions to postfix notation using a stack. For the first expression (A * B - (C - D)) / (E + F), it is converted to AB*C-D--EF+/ in postfix notation. For the second expression (A + B) * C + D / (E + F * G) – H, it is converted to AB+C*DEFG*+/+H- in postfix notation.

    Descriere originală:

    infix

    Titlu original

    infix

    Drepturi de autor

    © © All Rights Reserved

    Formate disponibile

    DOCX, PDF, TXT sau citiți online pe Scribd

    Vi se pare util acest document?

    Este necorespunzător acest conținut?

    Raportați acest document
    The document shows the steps to evaluate two infix expressions to postfix notation using a stack. For the first expression (A * B - (C - D)) / (E + F), it is converted to AB*C-D--EF+/ in postfix notation. For the second expression (A + B) * C + D / (E + F * G) – H, it is converted to AB+C*DEFG*+/+H- in postfix notation.

    Drepturi de autor:

    © All Rights Reserved
    Descărcați ca DOCX, PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    5 vizualizări2 pagini

    Infix

    Încărcat de

    Jayachandra Jc
    The document shows the steps to evaluate two infix expressions to postfix notation using a stack. For the first expression (A * B - (C - D)) / (E + F), it is converted to AB*C-D--EF+/ in postfix notation. For the second expression (A + B) * C + D / (E + F * G) – H, it is converted to AB+C*DEFG*+/+H- in postfix notation.

    Drepturi de autor:

    © All Rights Reserved
    Descărcați ca DOCX, PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    din 2

    infix: (A + B) * C + D / (E + F * G) – H

    (A * B - (C - D)) / (E + F)

    Symbol stack output


    ( (
    A ( A
    * (* A
    B (* AB
    - (- AB*
    ( (-( AB*
    C (-( AB*C
    - (-(- AB*C
    ) (-(-) AB*C-

    ) (-) AB*C--
    / / AB*C--
    ( /( AB*C--
    E /( AB*C—E
    + /(+ AB*C--E
    F /(+ AB*C—EF
    ) /(+) AB*C—EF+/

    symbol stack output


    ( (
    A ( A
    + (+ A
    B (+ AB
    ) (+) AB+
    * * AB+
    C * AB+C
    + + AB+C*
    D + AB+C*D
    / +/ AB+C*D
    ( +/( AB+C*D
    E +/( AB+C*DE
    + +/(+ AB+C*DE
    F +/(+ AB+C*DEF
    * +/(+* AB+C*DEF
    G +/(+* AB+C*DEFG
    ) +/ AB+C*DEFG*+
    - - AB+C*DEFG*+/+
    H - AB+C*DEFG*+/+H-

    AB+C*DEFG*+/+H-

    S-ar putea să vă placă și