# HG changeset patch # User Christian Urban # Date 1760269816 -3600 # Node ID 432d027aa6f7c42a80a06ab84aacc63451235334 # Parent eeeba9f76201f1afe9422b7ee3826d7457d93178 updated diff -r eeeba9f76201 -r 432d027aa6f7 slides/slides03.pdf Binary file slides/slides03.pdf has changed diff -r eeeba9f76201 -r 432d027aa6f7 slides/slides03.tex --- a/slides/slides03.tex Sat Oct 11 09:12:13 2025 +0100 +++ b/slides/slides03.tex Sun Oct 12 12:50:16 2025 +0100 @@ -38,7 +38,7 @@ Office Hour: & Friday 11:30 -- 12:30\\ Location: & N7.07 (North Wing, Bush House)\\ Slides \& Progs: & KEATS\\ - Pollev: & \texttt{\alert{https://pollev.com/cfltutoratki576}}\\ + %%Pollev: & \texttt{\alert{https://pollev.com/cfltutoratki576}}\\ \end{tabular} \end{center} @@ -60,8 +60,7 @@ \begin{textblock}{5}(12,3) \includegraphics[scale=0.35]{qr01}\\ - \small{}Wifi: \\ - \small{}Pwd: + \small{}Wifi: IET-Guest\\ \end{textblock} \end{frame} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @@ -83,27 +82,27 @@ %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% -\begin{frame}[c] - -\begin{mybox3}{From Pollev last week}\it -Is the equivalence of two regexes belong in the P or NP class of problems? -\end{mybox3} - -\end{frame} +%\begin{frame}[c] +% +%\begin{mybox3}{From Pollev last week}\it +%Is the equivalence of two regexes belong in the P or NP class of problems? +%\end{mybox3} +% +%\end{frame} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% -\begin{frame}[c] - -\begin{mybox3}{From Pollev last week}\it - If state machines are not efficient, then how/why do many lexer - packages like the logos crate in rust compile down a lexer - definition down to a jump table driven state machine? - \textcolor{gray}{Could we - achieve quicker lexing with things like SIMD instructions?} -\end{mybox3} -\end{frame} +%\begin{frame}[c] +% +%\begin{mybox3}{From Pollev last week}\it +% If state machines are not efficient, then how/why do many lexer +% packages like the logos crate in rust compile down a lexer +% definition down to a jump table driven state machine? +% \textcolor{gray}{Could we +% achieve quicker lexing with things like SIMD instructions?} +%\end{mybox3} +%\end{frame} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%