{"id":24016259,"url":"https://github.com/salahsheikh/boolean-decomposer","last_synced_at":"2026-03-04T09:01:09.053Z","repository":{"id":80498601,"uuid":"157020022","full_name":"salahsheikh/boolean-decomposer","owner":"salahsheikh","description":"Parses and computes a truth table for any logical expression using ANTLR4","archived":false,"fork":false,"pushed_at":"2018-11-15T01:46:37.000Z","size":5,"stargazers_count":3,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-15T14:07:18.268Z","etag":null,"topics":["antlr4","boolean-algebra","boolean-expression-parser","java","truth-table"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/salahsheikh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2018-11-10T20:45:35.000Z","updated_at":"2024-04-23T17:37:03.000Z","dependencies_parsed_at":null,"dependency_job_id":"589076a2-540e-43e5-957f-1d1da08c4c68","html_url":"https://github.com/salahsheikh/boolean-decomposer","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/salahsheikh/boolean-decomposer","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/salahsheikh%2Fboolean-decomposer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/salahsheikh%2Fboolean-decomposer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/salahsheikh%2Fboolean-decomposer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/salahsheikh%2Fboolean-decomposer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/salahsheikh","download_url":"https://codeload.github.com/salahsheikh/boolean-decomposer/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/salahsheikh%2Fboolean-decomposer/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30076935,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-04T08:01:56.766Z","status":"ssl_error","status_checked_at":"2026-03-04T08:00:42.919Z","response_time":59,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["antlr4","boolean-algebra","boolean-expression-parser","java","truth-table"],"created_at":"2025-01-08T08:48:42.612Z","updated_at":"2026-03-04T09:01:09.046Z","avatar_url":"https://github.com/salahsheikh.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Boolean Decomposer\n\u003e Parses and computes a truth table, minterms, and maxterms for any logical expression\n\n# Usage example\n\nExample code:\n```java\nString exp = \"A + (B XOR C) NAND B\";\nTruthTable t = new TruthTable(exp);\nt.generateTruthTable();\nt.print();\n\nSystem.out.println(\"MINTERMS:\");\nSystem.out.println(t.getMinterms().stream().map(String::toString).collect(Collectors.joining(\" + \")));\nSystem.out.println(\"MAXTERMS:\");\nSystem.out.println(t.getMaxterms().stream().map(String::toString).collect(Collectors.joining()));\n```\n\nFor the logical expression `\"A + (B XOR C) NAND B\"`\n\n```\nA\tB\tC\tOUTPUT\n0\t0\t0\t1\n0\t0\t1\t1\n0\t1\t0\t0\n0\t1\t1\t1\n1\t0\t0\t1\n1\t0\t1\t1\n1\t1\t0\t0\n1\t1\t1\t0\nMINTERMS:\nA'B'C' + A'B'C + A'BC + AB'C' + AB'C\nMAXTERMS:\n(A'+B+C')(A+B+C')(A+B+C)\n```\n\n# Supported Logical Functions\n\n* AND\n* OR\n* NOT\n* NAND\n* NOR\n* XOR\n* XNOR\n\nAlso supports alternate representations for logical functions such as \"\u0026\u0026\" (AND) and \"+\" (OR).\n\n# Building\n\nSimply run `gradle build` for Linux/Unix or `./gradlew build` for Windows","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsalahsheikh%2Fboolean-decomposer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsalahsheikh%2Fboolean-decomposer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsalahsheikh%2Fboolean-decomposer/lists"}