The Lounge is rated Safe For Work. If you're about to post something inappropriate for a shared office environment, then don't post it. No ads, no abuse, and no programming questions. Trolling, (political, climate, religious or whatever) will result in your account being removed.
Nice. Regex's, DFA's and NFA's are some of my favorite things.
You must have a lot of time on your hands to be doing such fun stuff...
Good for you!
Government can give you nothing but what it takes from somebody else. A government big enough to give you everything you want is big enough to take everything you've got, including your freedom.-Ezra Taft Benson
You must accept 1 of 2 basic premises: Either we are alone in the universe or we are not alone. Either way, the implications are staggering!-Wernher von Braun
I wrote a DFA based lexer generator which i use in my parsers, but I've been using gplex lately for lexing as i need unicode support and i don't think DFA regex engines can handle unicode.
I tried implementing unicode in my DFA based lexer and it choked during the powerset construction. Unicode just has too many characters. Maybe there's a better way but it's beyond me so I'm looking at the NFA approach which i've never done before.
I hate this terminology because all NFAs are DFAs but "NFA regex" is kind of a misnomer. A backtracking regular expression engine that usually uses a kind of bytecode interpreter rather than simple pattern matching to run its matches... dumb that it's called NFA regex but there it is.
Steve Wozniak is the only thing at Apple that isn't evil.
Last Visit: 3-Jul-20 18:27 Last Update: 3-Jul-20 18:27