This is an expression ppt for and or and xor gates

1. EXPRESSIONS

2. • Infix expression: The expression of the form an operator b (a
+ b). When an operator is in-between every pair of operands.
Postfix expression: The expression of the form a b operator
(ab+). When an operator is followed by every pair of operands.

3. Infix to Postfix
• Input: A + B * C + D
Output: ABC*+D+
• Input: A + B * C + D
Output: ABC*+D+

4. Infix to Postfix
• Input: ((A + B) – C * (D / E)) + F
Output: AB+CDE/*-F+
Input : a + b * c + d
Output: abc*+d+

5. Prefix
• A prefix notation is another form of expression but it does not
require other information such as precedence and associativity,
whereas an infix notation requires information of precedence
and associativity. It is also known as polish notation. In prefix
notation, an operator comes before the operands. The syntax of
prefix notation is given below:
• <operator> <operand> <operand>
• For example, if the infix expression is 5+1, then the prefix
expression corresponding to this infix expression is +51.
a * b + c
*ab+c

6. Infix Prefix Postfix
A+B +AB AB+
A+B-C -+ABC AB+C-
(A+B)*C-D -*+ABCD AB+C*D-