Write code which converts propositional expressions into clauses using the INOA rules we studied in class. A propositional expression is a well-formed formula or wff. They are entered in Polish prefix notation: p <=> q is written as imp p q. Typical dialog should be this, where I have underlined what the user types:
Enter wff: p
Clauses are: p
Enter wff: and p q
Clauses are: p q
Enter wff: imp p and q r
Clauses are: or not p q or not p r
Turn in: ΓΆβ?¬ΒΆ Printout of your code. ΓΆβ?¬ΒΆ Test runs on the following test cases: 1. imp p or q r 2. imp p imp q r 3. not imp or p r or q r 4. imp p and q r 5. imp and p q r 6. imp or p not q r
can somebody give suggestions how to start this program
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.