Truth table: Difference between revisions
Content added Content deleted
m (→{{header|C}}: Minor stylistic change.) |
(→{{header|Java}}: Incorrect. No source to compare.) |
||
| Line 1,297: | Line 1,297: | ||
=={{header|Java}}== |
=={{header|Java}}== |
||
{{incorrect|Java|No Source shown!}} |
|||
{{works with|Java|1.5+}} |
{{works with|Java|1.5+}} |
||
This example would require a system of pages that would be moderately complicated to set up and follow (or a really huge page that would also be hard to follow) since there is no [[eval]] in Java, so you can find information about it [http://sites.google.com/site/rekaeuqs1/truth here]. There is a link to an executable jar file with the required source files there. The program shows the expression and the truth table in a window. The expression must use prefix notation, single characters for input names (numerals, lowercase letters, and uppercase letters are the easiest to read), and the outputs can be shown as 1/0 or T/F. There is also a "Check" button which will make sure that the operators have enough operands. The window looks something like this: |
This example would require a system of pages that would be moderately complicated to set up and follow (or a really huge page that would also be hard to follow) since there is no [[eval]] in Java, so you can find information about it [http://sites.google.com/site/rekaeuqs1/truth here]. There is a link to an executable jar file with the required source files there. The program shows the expression and the truth table in a window. The expression must use prefix notation, single characters for input names (numerals, lowercase letters, and uppercase letters are the easiest to read), and the outputs can be shown as 1/0 or T/F. There is also a "Check" button which will make sure that the operators have enough operands. The window looks something like this: |
||