Scribd
Upload
26 views1 page

Boolean Expression Parser: Small Circuitscollection

This document describes a program that can simplify Boolean expressions or parse them from minterms. The program takes a Boolean expression or truth table as input and outputs the simplified expression. It works by entering the expression or minterm table and it will print the reduced expression. The source code for the program is available for free download.

Uploaded by

Radun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views1 page

Boolean Expression Parser: Small Circuitscollection

This document describes a program that can simplify Boolean expressions or parse them from minterms. The program takes a Boolean expression or truth table as input and outputs the simplified expression. It works by entering the expression or minterm table and it will print the reduced expression. The source code for the program is available for free download.

Uploaded by

Radun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

SMALL CIRCUITSCOLLECTION

Boolean Expression Parser


R. Sridhar used.
An example may help to explain the method. The table below
Given a Boolean expression or its minterms, the program has to be entered into the program by typing
described here prints the simplified (‘reduced’ or ‘parsed’)
expression. 1[Enter]3[Enter]–1[Enter]
Anyone who’s ever designed a fairly complex digital circuit
will know that what looks like a tangled network of logic gates and then replying ‘3’ to the number of variables prompt (we
and inverters may often be simplified by writing down every- need A, B and C).
thing that happens in the circuit in the form of Boolean expres-
sions and then discovering that these can often be condensed A B C OUT
in a way that allows your to actually cut down on the number 0 0 0 0
of ICs to be used! The program is also useful if you need to 0 0 1 1
design logic with nothing more front of you than a large truth
0 1 0 0
table describing the functionality.
The program was written to run under DOS which means that 0 1 1 1
it is not particularly user friendly but then again it’s free! 1 0 0 0
Boolean equations may be entered in two ways. One is to sim- 1 0 1 0
ply enter the equation, the other, to define the minterms. The 1 1 0 0
first method is fairly straightforward. The use of brackets is
1 1 1 0
not allowed. An inverted signal is entered by adding an apos-
trophe (‘) behind it, for example, AB becomes AB’, and AB is
entered as A’B’. The minus sign (–) is used to terminate the After a valid entry the program will print the simplified
entry. Boolean expression on the screen.
The use of minterms is practical if the Boolean equation is not The program executable code as well as the source code writ-
available, but you do have a truth table. Using this method you ten in C++ may be obtained from the Free Downloads section
mark those positions in the truth able that should use a out- at the publishers’ website, www.elektor-electronics.co.uk. The
put to become ‘1’. The value –1 is used to terminate the entry. file number is 020391-11, see month of publication.
Next, the program will ask you how many variables should be (020391-1)

2 Elektor Electronics 7-8/2003

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy