Problem:
Problem C: How can I satisfy thee? Let me count the ways...

Three-valued logic is a logic system that has, in addition to "true" and
"false", "unknown" as a valid value.

In the following, logical values "false", "unknown" and "true" are
represented by 0, 1 and 2 respectively.

Let "-" be a unary operator (i.e. a symbol representing one argument function)
and let both "*" and "+" be binary operators (i.e. symbols representing
two argument functions).
These operators represent negation (NOT), conjunction (AND) and
disjunction (OR) respectively.
These operators in three-valued logic can be defined in Table C-1.

Table C-1: Truth tables of three-valued logic operators

-X

(X*Y)

(X+Y)

Let P, Q and R be variables ranging over three-valued logic values.
For a given formula, you are asked to answer the number of triples (P,Q,R)
that satisfy the formula, that is, those which make the value of the
given formula 2.
A formula is one of the following form (X and Y represent formulas).

Constants: 0, 1 or 2

Variables: P, Q or R

Negations: -X

Conjunctions: (X*Y)

Disjunctions: (X+Y)

Note that conjunctions and disjunctions of two formulas are always
parenthesized.

For example, when formula (P*Q) is given as an input, the value of
this formula is 2 when and only when (P,Q,R) is (2,2,0), (2,2,1) or (2,2,2).
Therefore, you should output 3.

Input

The input consists of one or more lines. Each line contains a formula.
A formula is a string which consists of 0, 1, 2, P, Q, R, -, *, +, (, ).
Other characters such as spaces are not contained.
The grammar of formulas is given by the following BNF.

<formula> ::= 0 | 1 | 2 | P | Q | R |
-<formula> | (<formula>*<formula>) | (<formula>+<formula>)

All the formulas obey this syntax and thus you do not have to care about
grammatical errors.
Input lines never exceed 80 characters.

Finally, a line which
contains only a "." (period) comes, indicating the end of the input.

Output

You should answer the number (in decimal) of triples (P,Q,R) that make the
value of the given formula 2. One line containing the number should be
output for each of the formulas, and no other characters should be output.

Sample Input

(P*Q)
(--R+(P*Q))
(P*-P)
2
1
(-1+(((---P+Q)*(--Q+---R))*(-R+-P)))
.

Output for the Sample Input

3
11
0
27
0
7

Solution in Scala (judge verdict: Accepted)

object Main extends App {

  import scala.io.StdIn._
  solve
  def solve: Unit = {
    val line = readLine.trim
    if (line == ".") return
    line.toList match {
      case b Bool Nil ⇒ println(Combination.all.count(c ⇒ b(c) == True))
      case _ ⇒ ???
    }
    solve
  }
  object Combination {
    def all: List[Combination] = List.tabulate(3){_ ⇒ List(True, False, Unknown)}.foldLeft(Nil::Nil:List[List[Bool]]){(l, r) ⇒ l.flatMap(list ⇒ r.map(_::list))}.map{case p::q::r::Nil ⇒ Combination(p, q, r); case _ ⇒ ???}
  }
  case class Combination(p: Bool, q: Bool, r: Bool)
  sealed trait Bool {
    def unary_- : Bool
    def *(that: Bool): Bool
    def +(that: Bool): Bool
  }
  object Bool {
    def unapply(arg: List[Char]): Option[(Combination ⇒ Bool, List[Char])] = {
      arg match {
        case l Term rest ⇒ rest match {
          case Nil ⇒ Some(l, Nil)
          case '+'::(r Term t) ⇒ Some(c ⇒ l(c) + r(c), t)
          case '*'::(r Term t) ⇒ Some(c ⇒ l(c) * r(c), t)
          case _ ⇒ None
        }
        case _ ⇒ None
      }
    }
  }

  object True extends Bool {
    def unapply(arg: List[Char]): Option[(Bool, List[Char])] = {
      arg match {
        case '2'::t ⇒ Some(True, t)
        case _ ⇒ None
      }
    }
    override def unary_- : Bool = False
    override def * (that: Bool): Bool = that
    override def + (that: Bool): Bool = True
  }
  object False extends Bool {
    def unapply(arg: List[Char]): Option[(Bool, List[Char])] = {
      arg match {
        case '0'::t ⇒ Some(False, t)
        case _ ⇒ None
      }
    }
    override def unary_- : Bool = True
    override def * (that: Bool): Bool = False
    override def + (that: Bool): Bool = that
  }
  object Unknown extends Bool {
    def unapply(arg: List[Char]): Option[(Bool, List[Char])] = {
      arg match {
        case '1'::t ⇒ Some(Unknown, t)
        case _ ⇒ None
      }
    }
    override def unary_- : Bool = Unknown
    override def * (that: Bool): Bool = that match {
      case False ⇒ False
      case _ ⇒ Unknown
    }
    override def + (that: Bool): Bool = that match {
      case True ⇒ True
      case _ ⇒ Unknown
    }
  }
  object Variable {
    def unapply(arg: List[Char]): Option[(Combination ⇒ Bool, List[Char])] = {
      arg match {
        case 'P'::t ⇒ Some(_.p, t)
        case 'Q'::t ⇒ Some(_.q, t)
        case 'R'::t ⇒ Some(_.r, t)
        case _ ⇒ None
      }
    }
  }
  object Term {
    def unapply(arg: List[Char]): Option[(Combination ⇒ Bool, List[Char])] = {
      arg match {
        case '-'::(b Term t) ⇒ Some(c ⇒ -b(c), t)
        case '('::(b Bool ')'::t) ⇒ Some(b, t)
        case b True t ⇒ Some(_ ⇒ b, t)
        case b False t ⇒ Some(_ ⇒ b, t)
        case b Unknown t ⇒ Some(_ ⇒ b, t)
        case v Variable t ⇒ Some(v, t)
        case _ ⇒ None
      }
    }
  }
  implicit class Extension[T](val value :T) extends AnyVal {
    @inline
    def let[A](@inline func: T ⇒ A): A = func(value)
    @inline
    def also(@inline func: T ⇒ Unit): T = {func(value); value}
  }
}