A. Bellaachia
The George Washington University
School of Engineering and Applied Science
Department of Computer Science
CSci 169 – Software Paradigms – Fall 2006
Programming Assignment # 3: Logic Expression Simplifier
Due Date: Wednesday, November 29, 2006
Instructor: A. Bellaachia
Send the electronic version of your assignment to: [email protected]
Part I:
Consider the problem of simplifying an algebraic expression, such as the symbolic
differentiation. In this project, we would like to develop a
Logic Expression Simplifier
(LES)
using the following simplification rules:
- Simplification using mathematical identities of false (0) and True (1) when added or
multiplied with another expression:
o C or False = C
o C or True = True
o C and False = False
o C and True = C
C can be either a constant or an unknown variable.
Write a scheme function that implements the above rules.
Notes:
o “And” and “Or” are reserved keywords
o Space is a delimiter.
o You assume that the expression is syntactically correct.
o You need to read a logical expression in infix format and apply your LES
o You can assume that the input expression is fully parenthesized
Examples:
- Input: False and True
- Output: False
- Input: (C and True) or (Y or False)
- Output: C or Y (It is ok if your input may look like (C) or (Y))
- Input: (C and False) or (Y or True)
- Output: True (It is ok if your input may look like (C) or (Y))
