equal
deleted
inserted
replaced
91 match the regular expression. |
91 match the regular expression. |
92 \end{enumerate} |
92 \end{enumerate} |
93 |
93 |
94 % explain what is a context-free grammar and the language it generates |
94 % explain what is a context-free grammar and the language it generates |
95 % |
95 % |
96 % What does it mean for two regular expressions to be equivalent. |
|
97 % |
96 % |
98 % Define the language L(M) accepted by a deterministic finite automaton M. |
97 % Define the language L(M) accepted by a deterministic finite automaton M. |
99 % |
98 % |
100 % Draw a parse tree for.... |
|
101 % |
99 % |
102 % does (a + b)*b+ and (a*b+) + (b*b+) define the same language |
100 % does (a + b)*b+ and (a*b+) + (b*b+) define the same language |
103 % |
101 |
104 % What does it mean for a grammar to be ambiguous |
|
105 |
102 |
106 \end{document} |
103 \end{document} |
107 |
104 |
108 %%% Local Variables: |
105 %%% Local Variables: |
109 %%% mode: latex |
106 %%% mode: latex |