Chris Nebel
I am surprised and delighted: I have an actual work need to do an NFA-to-DFA transformation, which hasn’t happened in years.
Given a regular expression, this site will generate a diagram of the matching NFA and an equivalent DFA: http://hackingoff.com/compilers/regular-expression-to-nfa-dfa …
-
-
@nebelch Doesn't seem to work correctly for ()? constructs. Try (a|b)?x vs [ab]?x - they should generate the same graph afaik -
@nebelch Look for the "no a or b" path in each case -
@tristero_jl I suspect it’s treating “[ab]” as if it’s an atomic string, not a character set. -
@nebelch The [ab] case works - its the ()? combination that fails to create a path that matches zero occurrences -
@tristero_jl Oh, I see. Right you are; they have a bug. Curiously, (a|b)* and (a|b)+ work correctly.
-
Jeff Laing
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.