Re: How make multifinished DFA for merged regexps?

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.

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