Scribd
Upload
18 views1 page

Operator Stack Rules

The document outlines the rules for converting infix expressions to postfix notation using an operator stack. It details which operators can be pushed onto the stack based on their precedence and associativity. The table provided specifies the conditions under which each operator can be pushed over another operator.

Uploaded by

mhatreshravanii30
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views1 page

Operator Stack Rules

The document outlines the rules for converting infix expressions to postfix notation using an operator stack. It details which operators can be pushed onto the stack based on their precedence and associativity. The table provided specifies the conditions under which each operator can be pushed over another operator.

Uploaded by

mhatreshravanii30
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Operator Stack Rules for Infix to Postfix Conversion

Push This Over This Allowed? Reason

* + Yes * has higher precedence

+ * No + has lower precedence

/ + Yes / has higher precedence

- / No - has lower precedence

^ * Yes ^ has higher precedence

* ^ No * has lower precedence

^ ^ Yes ^ is right-associative

- + Yes Same precedence, left-associative

+ - Yes Same precedence, left-associative

You might also like