equal
deleted
inserted
replaced
497 \caption{The example given by Becchi and Crawley |
497 \caption{The example given by Becchi and Crawley |
498 that NFA simulation can consume large |
498 that NFA simulation can consume large |
499 amounts of memory: $.^*a.^{\{n\}}bc$ matching |
499 amounts of memory: $.^*a.^{\{n\}}bc$ matching |
500 strings of the form $aaa\ldots aaaabc$. |
500 strings of the form $aaa\ldots aaaabc$. |
501 When traversing in a breadth-first manner, |
501 When traversing in a breadth-first manner, |
502 all states from 0 till $n+1$ will become active.} |
502 all states from 0 till $n+1$ will become active.}\label{fig:inj} |
|
503 |
503 \end{figure} |
504 \end{figure} |
504 %Languages like $\mathit{Go}$ and $\mathit{Rust}$ use this |
505 %Languages like $\mathit{Go}$ and $\mathit{Rust}$ use this |
505 %type of $\mathit{NFA}$ simulation and guarantees a linear runtime |
506 %type of $\mathit{NFA}$ simulation and guarantees a linear runtime |
506 %in terms of input string length. |
507 %in terms of input string length. |
507 %TODO:try out these lexers |
508 %TODO:try out these lexers |