techhub.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
A hub primarily for passionate technologists, but everyone is welcome

Administered by:

Server stats:

5.6K
active users

Say you've compiled a regular expression to a "DFA" labelled graph. As described the other day. How'd you optimize it to match the same patterns in as little memory as possible?

These algorithms have decent performance, but you'll want to make full use of the results to pay back the time spent optimizing!

There's 3 main optimizations to perform:

1. Remove unreachable nodes
2. Remove nodes which won't reach an end-state.
3. Merge duplicate nodes.

1/4?

Sergey Shandar

@alcinnz deduplicate deeply equal nodes. If you use content-addressable language, don't need to perform this step.