Logic-F-day

Implementing the same functionality of Logic Friday to F#

Declaring variables. In is where you define a variable, giving a state in you evaluation will use the variables's value Out work as a probe, which binds the result to the name

let inVar =  (IN "VariableName");;

(Not implemented yet)
let outVar = (OUT ("OutVar", B true));;

Print to string and simplify/minimize gate composition

let simp = (AND (OR (IN "A", IN "B"), OR (IN "A", NOT (IN "B"))));;

simp.ToString();;
val it : string = "((A+B)*(A+~B))"

(Still work-in-progress)
gateSimplify simp;;
val it : gExp = IN "A"

Current infix operators for the syntax of the different gates

AND  :  .&.
NAND : .-&.
OR   :  .|.
NOR  : .-|.
XOR  : .*|.

Current and updated valid (Non-infix) operator syntax

NOT  : !! 
OR   : +
AND  : *
NAND : !* 
NOR  : !+ 
XOR  : *+ 
XNOR : !*+

Syntax for displaying the different gates

NOT  : ~
AND  : *  
NAND : ~* 
OR   : +  
NOR  : ~+ 
XOR  : x+ 
XNOR : x~+

Evaluate gates using variables

let st = Map.ofList [("A", B true)];;
let eval = ((IN "A") .&. (B true));;
gateEval eval st;;
val it : gExpResult = EVAL true

Dynamically evaluate expression if variables does not exist

let st = Map.ofList [("A", B true)];;
let eval = ((IN "A") .&. (IN "B"));;
gateEval eval st;;
val it : gExpResult = TYPE (IN "B")

Convert to only use NAND-gates and print to tree:

let nandonly = nandGateify ((NOT (IN "A").-&. IN "B") .*|. NOT (IN "A" .|. NOT(IN "A")));;
nandonly.PrintTree();;

                               ____~*___________________________                         
                              /                                 \                        
       ______________________~*_           ______________________~*_________             
      /                         \         /                                 \            
    ~*__________                ~*      ~*__________                   ______~*_         
    /           \               / \     /           \                 /         \        
  ~*       ______~*_          ~*  B   ~*       ______~*_            ~*__        ~*__     
  / \     /         \         / \     / \     /         \           /   \       /   \    
~*  B   ~*__        ~*__      A A   ~*  B   ~*__        ~*__      ~*    ~*    ~*    ~*   
/ \     /   \       /   \           / \     /   \       /   \     / \   / \   / \   / \  
A A   ~*    ~*    ~*    ~*          A A   ~*    ~*    ~*    ~*    A A ~*  ~*  A A ~*  ~* 
      / \   / \   / \   / \               / \   / \   / \   / \       / \ / \     / \ / \
      A A ~*  ~*  A A ~*  ~*              A A ~*  ~*  A A ~*  ~*      A A A A     A A A A
          / \ / \     / \ / \                 / \ / \     / \ / \                        
          A A A A     A A A A                 A A A A     A A A A                        

Print truthtable of Gates:

TruthTable (XNOR(IN "A",IN "B"));;
| A | B | O |
| T | T | T |
| F | T | F |
| T | F | F |
| F | F | T |