As the Peirce Logic team has taken on more members (and with them more ambitious goals), the breadth of topics being covered has really ballooned. People are now working on touch controls, UI, collision changes, back-end storage, and of course bug fixes aplenty. But to make sure all this new stuff works and our system remains stable, sometimes old code needs to be re-worked as well. Enter parsing! Currently, Peirce Logic can parse a user's logic string and create an object to be drawn as a graph. Below is a diagram showing roughly the function our parsing provides.
As a side note, there was some disagreement among operator precedence, some members thought conjunction and disjunction should have equal precedence, but we ended up going with the "standard" we found online, which is as follows: