Mark all that apply by writing either $T($for true$)$ or $F($for false$)$

in the blank box before each statement. Let $A,B,$ and $C$

denote nonterminals where $A$ is the root, let $t$ denote a

terminal, and let $$ denote the empty string. A regular

grammar is a grammar where all productions have the forms:

$A$::$=t,A$::$=Bt,orA$::$=.$

$A$::$=t,A$::$=AB,orA$::$=.$

$A$::$=t,A$::$=BA,orA$::$=A.$

$A$::$=t,A$::$=tt,orA$::$=B.$

$A$::$=t,A$::$=tB,orA$::$=BC.$

$A$::$=t,A$::$=tB,orA$::$=.$