Mark all that apply by writing either T $($for true$)$ or F $($for false$)$ in the blank box before each statement.

Every context$-$free grammar defines a language that can be described by a regular expression.

Every regular expression defines a language that cannot be described by a context$-$free grammar.

Left$-$regular grammars describe regular languages that cannot be described by right$-$regular grammars and vice versa.

The right$-$hand side of a production in a context$-$free grammar can be any string of terminals or nonterminals, but its left$-$hand side must be a single terminal.

The left$-$hand side of a production in a context$-$free grammar can be any string of terminals or nonterminals, but its right$-$hand side must be a single nonterminal.

All languages containing matched repetitions of pairs of symbols can be described by regular expressions.