Commit e22b9f2e authored by POTTIER Francois's avatar POTTIER Francois


parent a474a7d4
......@@ -404,6 +404,10 @@ The fragment of this graph that is reachable from `e`
is guaranteed to be finite,
and is exactly the desired automaton.
<!-- actually, if we are interested only in running the automaton up to
the first match, then a smaller graph suffices: a final state need have no successors.
If we are interested in finding all matches, then this graph is fine. -->
<!-- TEMPORARY can we point to a proof of finiteness? -->
There are several ways of approaching the construction of this finite graph
......@@ -413,10 +417,5 @@ the bijective correspondence between vertices (that is, expressions) and state
numbers. Once this is done, completing the construction of a data structure of
type `dfa` is easy.
<!-- TEMPORARY tabulating the transition function:
we could choose not to tabulate it,
but `delta` would then be invoked at automaton runtime,
every time a transition is taken.
By tabulating this function,
taking a transition at runtime becomes a simple matter
of doing two table lookups. -->
<!-- show an example of searching for one word, KMP -->
<!-- and an example of searching for multiple words, Aho-Corasick -->
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment