Filling PLA Programming Table
I noticed this post has gone unanswered for a long period of time as I was just recently looking for an answer to this question. I figured it out and would like to explain it in as simple of terms as I possibly can. Let's start by answering your question "how do I fill in the input table".

To explain this, I will be using these Boolean functions


and this example table:



The inputs for this table are simply indicating which variables in the product term (the product terms are the 4 expressions in the left-most column: AB', AC, BC, A'BC') are present as well as which of these variables are inverse or not inverse. For example, the product term AC has the input 1 - 1 meaning A and C are present in the product term and are both non-inverses or not prime.

The outputs are what I had trouble understanding at first. To understand these, we need to know how our PLA works. A PLA is used to represent or calculate a set of Boolean functions, in our case the two provided above (F1 and F2). A PLA first uses an array of AND gates and then OR gates to yield our Boolean functions. Take a look at the diagram of our Boolean functions below:


Let's figure out how we get the outputs "1 -" for our product term AB'. The T output is always going to be the XOR of 0 and our Boolean function, meaning the input of the XOR function is not going to be changed and will yield the same output as the input:

Also see the XOR truth table to make sense of why this is:



The C output is when we XOR 1 and the output of our OR gate. In our given example, we would do this on (AC + BC) in order to yield our F2 Boolean function: (AC + BC)'. If the product term in our table does not go to a T or C XOR gate, we would simply write a "-" for the output value.

Here is a more clear visual of our diagram illustrating how we obtain these output values for our given example: