; A DFA that recognizes the language generated by the following grammar.
;
; S --> the N V the N
;
; N --> hawk  |  dove  |  J N
;
; J --> red  |  gray  |  rapid  |  slow  |  hungry  |  plump
;
; V --> ate  |  fed

state  q0   the => q1
              * => q6
state  q1  hawk => q2
           dove => q2
            red => q1
           gray => q1
          rapid => q1
           slow => q1
         hungry => q1
          plump => q1
              * => q6
state  q2   ate => q3
            fed => q3
              * => q6
state  q3   the => q4
              * => q6
state  q4  hawk => q5
           dove => q5
            red => q4
           gray => q4
          rapid => q4
           slow => q4
         hungry => q4
          plump => q4
              * => q6
accept q5     * => q6
state  q6     * => q6