63 \small{}Wifi: IET-Guest\\ |
63 \small{}Wifi: IET-Guest\\ |
64 \end{textblock} |
64 \end{textblock} |
65 \end{frame} |
65 \end{frame} |
66 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
66 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
67 |
67 |
|
68 |
|
69 |
|
70 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
|
71 \begin{frame}[c] |
|
72 |
|
73 \begin{mybox3}{From Mentimeter}\it |
|
74 Is there a specific reason Python and the other programming |
|
75 languages have not implemented their regex matcher like the much |
|
76 faster algorithms described in the videos? |
|
77 \end{mybox3} |
|
78 |
|
79 \begin{mybox3}{From the Survey}\it |
|
80 If worst case for regex with derivatives is same as a |
|
81 normal regex engine, why is there a heavy focus on regex |
|
82 for lexer given most languages don't use it. |
|
83 \end{mybox3} |
|
84 |
|
85 \end{frame} |
|
86 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
|
87 |
|
88 |
|
89 |
68 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
90 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
69 { |
91 %{ |
70 \setbeamercolor{background canvas}{bg=cream} |
92 %\setbeamercolor{background canvas}{bg=cream} |
71 \begin{frame}[c] |
93 %\begin{frame}[c] |
72 \frametitle{For Installation Problems} |
94 %\frametitle{For Installation Problems} |
73 |
95 % |
74 \begin{itemize} |
96 %\begin{itemize} |
75 \item Harry Dilnot (harry.dilnot@kcl.ac.uk) \\ |
97 %\item Harry Dilnot (harry.dilnot@kcl.ac.uk) \\ |
76 \;\;Windows expert |
98 % \;\;Windows expert |
77 \item Oliver Iliffe (oliver.iliffe@kcl.ac.uk) |
99 %\item Oliver Iliffe (oliver.iliffe@kcl.ac.uk) |
78 \end{itemize} |
100 %\end{itemize} |
79 |
101 % |
80 \end{frame} |
102 %\end{frame} |
81 } |
103 %} |
82 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
104 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
83 |
105 |
84 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
106 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
85 %\begin{frame}[c] |
107 %\begin{frame}[c] |
86 % |
108 % |
191 %\end{document} |
213 %\end{document} |
192 % @@@@@@@@@@@@@@@@@@ |
214 % @@@@@@@@@@@@@@@@@@ |
193 |
215 |
194 |
216 |
195 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
217 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
196 \begin{frame}[c] |
218 %\begin{frame}[c] |
197 |
219 % |
198 \begin{mybox3}{From Pollev last week}\it |
220 %\begin{mybox3}{From Pollev last week}\it |
199 For a regular expression $r = r_1 \cdot r_2$, to prove that |
221 % For a regular expression $r = r_1 \cdot r_2$, to prove that |
200 $der\;c\;r = (der\;c\;r) \cdot r^{\{n-1\}}$, is there a |
222 % $der\;c\;r = (der\;c\;r) \cdot r^{\{n-1\}}$, is there a |
201 way to prove it in the general case instead |
223 % way to prove it in the general case instead |
202 of how you do the calculations for each $n$ in the videos? |
224 % of how you do the calculations for each $n$ in the videos? |
203 \end{mybox3} |
225 %\end{mybox3} |
204 |
226 % |
205 \end{frame} |
227 %\end{frame} |
206 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
228 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
207 |
229 |
208 |
230 |
209 |
231 |
210 { |
232 { |
1840 \end{frame} |
1864 \end{frame} |
1841 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
1865 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
1842 |
1866 |
1843 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
1867 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
1844 \begin{frame}[c] |
1868 \begin{frame}[c] |
|
1869 \frametitle{Hierarchy of Languages} |
|
1870 |
|
1871 \begin{center} |
|
1872 \begin{tikzpicture} |
|
1873 [rect/.style={draw=black!50, |
|
1874 top color=white, |
|
1875 bottom color=black!20, |
|
1876 rectangle, |
|
1877 very thick, |
|
1878 rounded corners}, scale=1.2] |
|
1879 |
|
1880 \draw (0,0) node [rect, text depth=39mm, text width=68mm] {all languages}; |
|
1881 \draw (0,-0.4) node [rect, text depth=28.5mm, text width=64mm] {decidable languages}; |
|
1882 \draw (0,-0.85) node [rect, text depth=17mm] {context sensitive languages}; |
|
1883 \draw (0,-1.14) node [rect, text depth=9mm, text width=50mm] {context-free languages}; |
|
1884 \draw (0,-1.4) node [rect] {regular languages}; |
|
1885 \end{tikzpicture} |
|
1886 |
|
1887 \end{center} |
|
1888 |
|
1889 \end{frame} |
|
1890 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
|
1891 |
|
1892 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
|
1893 \begin{frame}[c] |
1845 \frametitle{Negation} |
1894 \frametitle{Negation} |
1846 |
1895 |
1847 Regular languages are closed under negation:\bigskip |
1896 Regular languages are closed under negation:\bigskip |
1848 |
1897 |
1849 \begin{center} |
1898 \begin{center} |