Class PlParser

  • Direct Known Subclasses:
    QbfParser

    public class PlParser
    extends Parser<PlBeliefSet,​PlFormula>
    This class implements a parser for propositional logic. The BNF for a propositional belief set is given by (starting symbol is FORMULASET)

    FORMULASET ::== FORMULA ( "\n" FORMULA )*
    FORMULA ::== PROPOSITION | "(" FORMULA ")" | FORMULA ">>" FORMULA | FORMULA "||" FORMULA | FORMULA "=>" FORMULA | FORMULA "<=>" FORMULA | FORMULA "^^" FORMULA | "!" FORMULA | "+" | "-"

    PROPOSITION is a sequence of characters excluding |,&,!,(,),=,<,> and whitespace characters.
    Author:
    Matthias Thimm, Bastian Wolf