Re: burg with n-ary trees?

Tom Harwood <>
12 Feb 2000 21:31:18 -0500

          From comp.compilers

Related articles
burg with n-ary trees? (George Almasi) (2000-02-10)
Re: burg with n-ary trees? (Rodrigo Augusto B. Ferreira) (2000-02-12)
Re: burg with n-ary trees? (Tom Harwood) (2000-02-12)
Re: burg with n-ary trees? (Vladimir Makarov) (2000-02-12)
Re: burg with n-ary trees? (Daniel C. Wang) (2000-02-12)
| List of all articles for this month |

From: Tom Harwood <>
Newsgroups: comp.compilers
Date: 12 Feb 2000 21:31:18 -0500
Organization: Allaire Corporation
References: 00-02-039
Keywords: tools

Hello George,

It's an interesting question. I can't think of any theoretical reason
why a BURM couldn't rewrite n-ary trees, although modifying the
existing tools to do so would involve a fair amount of grunt work :)

The BURGs I've written all used binary trees as input, but since a node
can have 0, 1, or 2 children the label and reduce logic is n-ary in a
limited sense.

Tom Harwood
ColdFusion Language Development
Allaire Corporation

Post a followup to this message

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