This projects aims to receive an well formed formula of the proposional logic and, after some steps, convert it into equivalent pcode instructions.

1. Catch the logical expression from input;
2. Running it in a pushdown automata;
3. Use result of step 2 to build a binary tree;
4. Run postorder transversal at btree to build reverse polish notation;
5. Convert RPN into valid Pcode instructions;
6. Run pcode and then generate output file;

E -> 0 | 1 | p | q | !E | (EAEB
A -> & | | | : | - 
B -> )

Note: Your program do not assign value to p and q, although accept it.

gcc -o teste ada2asa.c pcode.c rpn2pci.c btree2rpn.c pushdown.c main.c

./teste "expression"

• For successful conversion the user must provide a balanced logical expression.

See and file on repo.