True or False: Write a T or F in the blank Automata is just another name for a graph YACC is a tool that is used to build a parser It is called a 'finite' state automata because it will only work for finite languages the only way to represent an automata is the nodes/edges graphical diagram Regular grammar just means that the grammar is correctly written A context free grammar is also a regular grammar A regular grammar is also a context free grammar BNF rules are used as the production rules in a context free grammar Regular Expression (a | b) (c | d) generates a finite language RE's (a | b) (c | d) and (c | d)(a | b) denote different languages {set of words} RE's (a | b) (c | d) and (b | a) (c | d) denote different languages RG's can be used to replace any context free grammar