Add mod(2) XOR Gauss-Jordon solver to an existing boolean calaculator tool
1) tool currently acts on a single statement, add multiple statement input to language, parse tree, and symbol table
2) extract parse tree into a mod(2) linear algebra arrays and solve with Gauss-Jordon
3) Output all solved terms as a single product term
4) Output all unsolved terms as sum-of-products statements that can be re-entered into the tool later ... IE same form as input.
I will provide C source with existing flex/bison parser and parse tree for the calculator
If you have previous experience with flex/bison and Gauss-Jordon linear algebra solvers from school, this should be a 1 day job. If not, read up before bidding. I would like project completed within a few days
Được trao cho:
Hi! I'm interesting your project very well. I am mastering c++ and I'm a good Mathematician. And also I have many experience and good skill about algorithm. Let's go ahead with me
19 freelancer đang chào giá trung bình $609 cho công việc này
Hi! I have seen your proposal carefully. I can do it. Relevant Skills and Experience c, Mathmatic Please contact me. Proposed Milestones $555 USD - discuss Thank you for your reply.
Hi Thank you for your invitation for this project, please contact me for your project. So we can discuss about your project more detail. Best Liu