truthtable

I'm trying to generate a truth table for a given boolean expression. I could do this with creating a new Datatype BoolExpr, but I want to do it with an anonymous function. It's supposed to work like this: > tTable (\x y -> not (x || y)) output: F F | T F T | F T F | F T T | F My approach: tbl p = [(uncurry p) tuple | tuple <- allval] where allval=[(x,y) | x <- [False,True], y <- [False,True]] This works, but only for 2 Arguments. I want to do it for any number of Arguments. So I figured I would make a function that takes the Arguments from a List: argsFromList f [] = f argsFromList f (x:xs) =

Table true/false for C Language I have heard of a table true false for C Language for and && or || is kind of the mathematics one for which they say if true+true=true and false+true=false I'm just kind of confuse on this and I tried to do the research but couldn't find any of the table I just wish to have this table for my notes since I will do more in C language if someone could bring me to the site or resources where they explain about this more I've edited my original question to make it a note for my own study. Thanks @thiton for the great references and the rest for an awesome answer

So I have a bit sequence: 1010 1 is the MSB. My function needs to return an integer of 0 if an odd bit is 0 or a 1 if its a 1. I cannot use any for loops or anything of that nature to see if I need to return a 0 or 1. Does anyone have any suggestions how to go about this. I was thinking about using a not operation but I can figure out how to exactly use it. So far I am using a sequence of 1010...10 and then anding it. Doing that to the above would get me 1010. Now I need to find out if I return a 1 or a 0. Say we're talking about 32bit integers. I assume you want to know if ANY ODD bit is SET

I'm trying to print some truth tables as part of a school assignment. How can I generate a dynamic size truth table in Java? So that printTruthTable(1) prints: 0 1 printTruthTable(3) prints: 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 And so on. I have been trying to implement it using recursion, but I just can't get it right. here's my take on your problem, all written nice and tight in a small class, just copy/paste notice how I used modulo2 (the % sign) to get 0's and 1's from the loop indices public class TruthTable { private static void printTruthTable(int n) { int rows = (int) Math

I'm looking to write a Truth Table Generator as a personal project. There are several web-based online ones here and here . (Example screenshot of an existing Truth Table Generator ) I have the following questions: How should I go about parsing expressions like: ((P => Q) & (Q => R)) => (P => R) Should I use a parser generator like ANTLr or YACC, or use straight regular expressions? Once I have the expression parsed, how should I go about generating the truth table? Each section of the expression needs to be divided up into its smallest components and re-built from the left side of the table

I'm looking for some advice on my school project. I am supposed to create a program that takes a logical expression and outputs a truth table for it. The actually creating of the truth table for me is not difficult at all and I've already wrote the methods in Java for it. I would like to know if there are any classes in java that I could use to parse the expression for me and put it into a stack. If not I'm looking for help on parsing the expression. It's the parentheses that get me whenever I try and think it through. Also if this would be easier in any other language I would be open to doing