How make multifinished DFA for merged regexps?

From	Andy <borucki.andrzej@gmail.com>
Newsgroups	comp.compilers
Subject	How make multifinished DFA for merged regexps?
Date	2019-12-19 18:19 -0800
Organization	Compilers Central
Message-ID	<19-12-005@comp.compilers> (permalink)

Show all headers | View raw

I can create DFA direct from regexp.
But for language lexer I must have DFA for couple regexp.
One solution is crating DFA with multi finished states.
For example
r0 = ab
r1 = ac

  | 0 | 1
a | 1 |
b |   | 2(F)
c |   | 3(F)

How to check if r0 and r1 are disjoint?

Back to comp.compilers | Previous | Next — Next in thread | Find similar

Thread

How make multifinished DFA for merged regexps? Andy <borucki.andrzej@gmail.com> - 2019-12-19 18:19 -0800
  Re: How make multifinished DFA for merged regexps? Kaz Kylheku <493-878-3164@kylheku.com> - 2019-12-20 05:54 +0000
  Re: How make multifinished DFA for merged regexps? Andy <borucki.andrzej@gmail.com> - 2019-12-20 16:29 -0800
    Re: How make multifinished DFA for merged regexps? Kaz Kylheku <493-878-3164@kylheku.com> - 2019-12-21 04:04 +0000
    Re: How make multifinished DFA for merged regexps? Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2019-12-24 02:15 +0100
  Re: How make multifinished DFA for merged regexps? Matt Timmermans <matt.timmermans@gmail.com> - 2019-12-23 22:29 -0800
  Re: How make multifinished DFA for merged regexps? rockbrentwood@gmail.com - 2019-12-29 20:56 -0800

csiph-web