An implementation of the Quine-McCluskey-Algorithm for Boolean function minimization, written in C.
-
Updated
Jun 9, 2025 - C
An implementation of the Quine-McCluskey-Algorithm for Boolean function minimization, written in C.
2nd Year: 1st - 97. A full parser for first order logic, producing a parse tree (png) and a grammar containing all production rules and symbols, along with a log file.
Add a description, image, and links to the logic-parser topic page so that developers can more easily learn about it.
To associate your repository with the logic-parser topic, visit your repo's landing page and select "manage topics."