Re: Forming an AST node for a sequence or list

Rodney M. Bates wrote:
> Jeff Lasslett wrote:
>
>>Greetings,
>> I have a couple of grammar elements of the following form:
>>
>>A -> Ab | b ( or in yacc form A : A "b" | "b"; )
>>
>>I am planning to form strings matched by this type of rule into AST
>>nodes that look like this (given the input string "bbb"):-
>>
>> A
>> /|\
>> b b b
>>
>
>
> One traditional way is to represent the list node using the
> binary-tree-representation-of-n-ary-tree technique, i.e. the above
> example is physically linked as:
>
> A
> /
> b-b-b


Thanks Rodney. This is exactly what I've done. It works beautifully.
My parser now builds a syntax tree. Now I have to decorate it with type
information and think about generating some code.


Cheers,
Jeff

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