Tuesday, 20 May 2014

Day 0: Parsers

For the first official day of coding, I coded the first two versions of two parsers. The first was for the TPTP format, and the second, which relies (partially) on the TPTP format, is one for the actual proof output for the SPASS theorem prover. The parsers currently only read input and then discard it, because I haven't yet decided how to modify the proof classes of Skeptik to handle FOL proofs--that's the goal for tomorrow, and after that, completing the parsers should be easy.

A note on the TPTP parser: there are several existing parsers written in Scala for it, e.g. one in the MELIA repository, and it seems like it would parse a greater set of text then the one I wrote today, but it's so deeply tied into the MELIA code that it's useless until I modify the Skeptik proof classes in order to possibly replace the MELIA classes with Skeptik ones. So for now, I'm going to use my small one, which doesn't require me to possibly break some one else's code, and allows me greater control. If all goes well, I'll swap mine out later in the week.

No comments:

Post a Comment