Write T for true, F for false.

1.  Every subset of a regular language is regular.

2.  The set of all regular expressions over the binary alphabet is a
    regular language.

3.  The intersection of a context-free language with a regular language
    is always context-free.

5.  The union of any collection of regular languages is regular.

6.  A bottom-up parser constructs the parse tree of a string in
    reverse postorder.

7.  A top-down parser constructs the parse tree of a string in preorder.

8.  The complement of any context-free language is context-free.

9.  The complement of any regular language is regular.

10. Every non-empty context-free language has an ambiguous context-free
    grammar.

11. If M_1 is an NFA with n states, then M_1 is equivalent to some DFA
    M_2 with at most 2^n states.

12. If L is a language and L* is the Kleene closure of L, and if L* is
    regular, then L must be regular.