Module biodivine_sketchbook::algorithms::fo_logic::parser

source ยท

Functionsยง

  • index_of_first ๐Ÿ”’
    Utility method to find the first occurrence of a specific token in the token tree.
  • Utility method to find the first occurrence of a quantifier operator in the token tree.
  • Utility method to find the first occurrence of an unary operator in the token tree.
  • is_quantifier ๐Ÿ”’
    Predicate for whether given token represents a quantifier.
  • is_unary ๐Ÿ”’
    Predicate for whether given token represents unary operator.
  • Recursive parsing step 1: extract quantifier operators.
  • parse_2_iff ๐Ÿ”’
    Recursive parsing step 2: extract <=> operators.
  • parse_3_imp ๐Ÿ”’
    Recursive parsing step 3: extract => operators.
  • parse_4_or ๐Ÿ”’
    Recursive parsing step 4: extract | operators.
  • parse_5_xor ๐Ÿ”’
    Recursive parsing step 5: extract ^ operators.
  • parse_6_and ๐Ÿ”’
    Recursive parsing step 6: extract & operators.
  • parse_7_unary ๐Ÿ”’
    Recursive parsing step 7: extract unary operators (just a negation currently).
  • Recursive parsing step 8: extract terms and recursively solve sub-formulae in parentheses and in functions.
  • Parse an FOL formula string representation into an actual formula tree with renamed (minimized) set of variables.
  • Parse an FOL formula string representation into an actual formula tree. Basically a wrapper for tokenize+parse (used often for testing/debug purposes).
  • Parse tokens of FOL formula into an abstract syntax tree using recursive steps.