> Like e.g. the generated code
>IF match-char1 THEN ..
>ELSIF match-char2 THEN ..
>ELSIF match-char3 THEN ..
>..
>END
> ?
Similar. It identifies ranges of character point sets and
brackets them via binary bracketting.
> Why to complicate the things? The determinist finite autom
'pattern-action' pairs as
a basis for 'c-lex.c' ?
Best Regards,
Frank
Original-Nachricht
Datum: 31 May 2007 17:15:03 +0200
Von: Andi Kleen <[EMAIL PROTECTED]>
An: "Frank Schaefer" <[EMAIL PROTECTED]>
CC: gcc@gcc.gnu.org
Betreff: Re:
Dear GCC Team,
Last weekend I finished the release of my directly coded
analyzer generator engine for Quex. First, I thought, it would
be just a nice idea to step away from table driven approach
of flex/lex. Directly coding also facilitates the step towards
analysis of different character encodi
