[Solved] C-Project a logic circuit

For this assignment, you are expected to write a program which simulates a logic circuit for a set of given inputs. In this assignment, you are going to use structure and dynamic memory allocation.

Be careful with file names. You won’t given a chance to correct any mistakes.

• Your program reads two files:
  • txt
  • txt
• Your program creates a text file:
  • txt
• According to content in _txt, the program _dynamically creates necessary structures for a logic circuit and evaluates the cases listed in _input.txt.
• Your program prints the output to _txt. Each output step should be on a separate line. circuit.txt
• Each line starts with a _keyword. Possible _keywords:

INPUT

AND

OR

NOT

FLIPFLOP

• The first line specifies input labels. Labels are separated by spaces. Example:

INPUT a input2 c3 k

• Here there are ₄ inputs are defined. Each has an identifier. _a, _input2, _c3, _k.
• _AND keyword specifies that there is an _and gate defined. _AND keyword follows the identifier for the gate and two other identifiers for the inputs. Example:

AND gate_A c3 another_id

• Here the _and gate is identified by the string _{gate_A}. Its inputs are identified _c3 and _{another_id}. These identifiers can be input identifiers or identifiers for other gates.
• _OR keyword specifies that there is an _or gate defined. _OR keyword follows the identifier for the gate and two other identifiers for the inputs. Example:

OR gate_B ck id3

• Here the _or gate is identified by the string _{gate_B}. Its inputs are identified _ck and _id3. These identifiers can be input identifiers or identifiers for other gates.
• _NOT keyword specifies that there is an _not gate defined. _NOT keyword follows the identifier for the gate and one other identifier for its input. Example:

NOT gate_C c5

• Here the _not gate is identified by the string _{gate_C}. It has only one input an it is identified by the string _c5.
• _FLIPFLOP keyword specifies that there is an _flip-flop gate defined. _FLIPFLOP keyword follows the identifier

for the gate and one other identifier for its input. Example:

FLIPFLOP gate_F c6

• Here the _flip-flop gate is identified by the string _{gate_F}. Its input is identified by _c6. txt
• Each line is a list of ₁ and ₀. Example:

1 0 1 1

0 1 1 1

• 0 1 0
• 0 0 1

Example:

• Suppose that _txt is has the following content:

INPUT a b c d AND and1 a b

OR or1 and1 c

NOT n1 d

FLIPFLOP f1 n1

AND a2 or1 f1

• _txt has the following content:

1 1 0 1

1 0 1 0

1 1 1 0

• Assume that initially former-out of any FLIPFLOP is 0.
• Any _FLIPFLOPs should preserve the state throughout the evaluation of the whole _txt.
• Each line in _txt is assigned to identifiers _a, _b, _c, _d, defined in _circuit.txt. According to the truth tables, outputs of gates are calculated.
• For the input.txt given, the contents of output.txt should be:

0

1

0

Remarks

• Output is not defined explicitly. It is your job to figure out the output pin. There will always going to be one output pin.
• Each identifier is unique. Max length of each identifier is ₁₀
• Assume there won’t be multiple spaces separating the identifiers, keywords or data. Tokenize it according to this assumption.
• There won’t be any errors in the files.
• You have to use dynamical memory allocation and struct. You have to use struct in order to represent the gates of the circuit.
• Do not submit your code without testing it with several different scenarios. Try cases with multiple gates of the same type. Try cases with single gate. Try _txt with thousands of lines. Try cases with many gates. Try cases where there are many inputs.
• You can use _{c structs}, unions, arrays, c strings, pointers, recursion.
• Write comments in your code.
• Do not print anything to _stdout and _stderr.
• Do not submit any of the files you used for testing.
• Do not submit your output file.

Truth Tables:

• AND

a	b	out
0	0	0
0	1	0
1	0	0
1	1	1
a	b	out
0	0	0
0	1	1
1	0	1
1	1	1

• OR
• NOT

a	out
0	1
1	0

• FLIPFLOP

a	former_out	out
0	0	0
0	1	1
1	0	1
1	1	0