How make multifinished DFA for merged regexps?

Andy <borucki.andrzej@gmail.com>
Thu, 19 Dec 2019 18:19:55 -0800 (PST)

          From comp.compilers
Related articles
How make multifinished DFA for merged regexps? borucki.andrzej@gmail.com (Andy) (2019-12-19)
Re: How make multifinished DFA for merged regexps? 493-878-3164@kylheku.com (Kaz Kylheku) (2019-12-20)
How make multifinished DFA for merged regexps? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2019-12-20)
Re: How make multifinished DFA for merged regexps? borucki.andrzej@gmail.com (Andy) (2019-12-20)
Re: How make multifinished DFA for merged regexps? 493-878-3164@kylheku.com (Kaz Kylheku) (2019-12-21)
How make multifinished DFA for merged regexps? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2019-12-23)
Re: How make multifinished DFA for merged regexps? DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2019-12-24)
[3 later articles]
| List of all articles for this month |
From: Andy <borucki.andrzej@gmail.com>
Newsgroups: comp.compilers
Date: Thu, 19 Dec 2019 18:19:55 -0800 (PST)
Organization: Compilers Central
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="9106"; mail-complaints-to="abuse@iecc.com"
Keywords: lex, question, DFA
Posted-Date: 19 Dec 2019 23:01:21 EST

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?

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.