2a/3: Continuous Assignment.

   // Define combinational logic:
   assign a = (g) ? 33 : b * c;
   assign b = d + e;

• Order of continuous assignments is un-important,
• Loop free, otherwise: parasitic level-sensitive latches are formed (e.g. RS latch),
• Right-hand side's may range over rich operators (e.g. mux ?: and multiply *),
• Bit inserts to vectors are allowed on left-hand sides (but not combinational array writes).

    assign   d[31:1] = e[30:0];
    assign   d[0] = 0;