Re: a token scanner DFA for indirection operator * ?

      Yes, there is a way. Please look at my own C front-end in OCAML
(http://casse.hugues.free.fr/projects/frontc.html). The "*" may be used
prefixed or infixed in C expression: not a problem for LR(1) parser. In
type definition, the "context" is very different and no problem arises.
      Issues come from the declaration types using "typedef" names. In case
of blocks "{" ... "}", knowledge of symbol kind is required in order to
separate declaring part from statement part.


Hugues Cassé.


Alex Colvin wrote:
>>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
> (int)*ptr
> (width)*height
> which requires knowing that "int" is a type (or typedef) in the current
> scope.

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