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

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

Every regular language can be described by a regular expression.

Every left$-$regular grammar describes a language that can also be described by a right$-$regular grammar and vice versa.

Languages containing matching symbols like parentheses, brackets or braces can be described by regular expressions.

The right$-$hand side of a production in a context$-$free grammar can be any string of terminals or nonterminals, and the left$-$hand side can be any individual terminal or nonterminal.

The left$-$hand side of a production in a context$-$free grammar can be any string of terminals or nonterminals, and the right$-$hand side can be any individual terminal or nonterminal.