Write T for true, F for false.

1.  Every Turing machine can be emulated by some DFA.

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.

4.  Any function that can be computed by any machine can be computed by
    some Turing machine.

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.  Every decidable language is generated by a general grammar.

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

11. Every language is enumerable.