Re: How make multifinished DFA for merged regexps?

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

Show all headers | View raw

Greedy algorithms match longest regexp. For example operators "+" and "++",
int numbers "123" and float numbers "123.456e3".
On '.' will finish state of number, but we will inside automata for float
number. But can be errors: after '.' will 'a'. We must backtrack to last
finished state? I want avoid backtracking. Maybe after backtracking we must
read chars from auxiliary token buffer instead of stream up to previous
position? But this complicated parsing.

Back to comp.compilers | Previous | Next — Previous in thread | 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