Expression Parsing

 Expression Parsing in Data Structure 

The way to write arithmetic expression is known as a notation. An arithmetic expression can be written in three different but equivalent notations, i.e., without changing the essence or output of an expression. These notations are −

• Infix Notation
• Prefix (Polish) Notation
• Postfix (Reverse-Polish) Notation

These notations are named as how they use operator(+,-,*,/) in expression.

Infix Notation

Operators are used in-between operands e.g. a - b + c.

This format is simple for humans to read, write, and speak in infix notation but this format is difficult to implement and handle with computing devices.

Tme and space complexity can be increase for implementation of algorithm of infix notation.

Prefix Notation

In this notation, operator is prefixed to operands, i.e. operator is written ahead of operands. For example, +ab. This is equivalent to its infix notation a + b. Prefix notation is also known as Polish Notation.

 Postfix Notation

This notation style is known as Reversed Polish Notation. In this notation style, the operator is postfixed to the operands i.e., the operator is written after the operands. For example, ab+. This is equivalent to its infix notation a + b.