|a token scanner DFA for indirection operator * ? firstname.lastname@example.org (RonG) (2004-03-26)|
|Re: a token scanner DFA for indirection operator * ? email@example.com (Alex Colvin) (2004-04-03)|
|Re: a token scanner DFA for indirection operator * ? firstname.lastname@example.org (2004-04-03)|
|Re: a token scanner DFA for indirection operator * ? email@example.com (Dmitry A. Kazakov) (2004-04-03)|
|Re: a token scanner DFA for indirection operator * ? firstname.lastname@example.org (=?ISO-8859-1?Q?Cass=E9_Hugues?=) (2004-04-15)|
|From:||Alex Colvin <email@example.com>|
|Date:||3 Apr 2004 09:02:19 -0500|
|Organization:||The World : www.TheWorld.com : Since 1989|
|Posted-Date:||03 Apr 2004 09:02:19 EST|
>I'm trying to write a token scanner for C, and I'm wondering if there is a
>detrministic finite automata (DFA) or state machine for the '*'
>indirection operator(IOP), or if differentiation between the multiply
>operator and the IOP is better left to the parser. Right now my scanner
This is usually left to the parser.
you have to distinguish
which requires knowing that "int" is a type (or typedef) in the current
mac the naïf
Return to the
Search the comp.compilers archives again.