Logical expressions may combine many connectives applied according to the follow

Question

Logical expressions may combine many connectives applied according to the following operation hierarchy: all ~ are applied first next all & are applied next all v are applied next all --> are applied finally all <--> are applied Parentheses may be used to override this hierarchy. A Logical expression which always evaluates to true is called a tautology. Example: (P --> Q) <--> (~P v Q) is a tautology, because it is true for all possible combinations of true/false values of P and Q. Write a program that tells you if the expression entered is a tautology or not. Assume that you have no more than three propositional symbols in your expressions -- call them P, Q, R. You must use the linked list implementation of the data structures needed.

Using java, please use both stacks AND queues to accomplish there. A stack for the operators and a queue for the infix/postfix expressions

Explanation / Answer

import java.util.*; public class tautology { public static void main(String args[]) { LinkListADT s=new LinkListADT(); s.postfix("(P>Q)P~Qv

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.