|burg with n-ary trees? firstname.lastname@example.org (George Almasi) (2000-02-10)|
|Re: burg with n-ary trees? email@example.com (Rodrigo Augusto B. Ferreira) (2000-02-12)|
|Re: burg with n-ary trees? firstname.lastname@example.org (Tom Harwood) (2000-02-12)|
|Re: burg with n-ary trees? email@example.com (Vladimir Makarov) (2000-02-12)|
|Re: burg with n-ary trees? firstname.lastname@example.org (Daniel C. Wang) (2000-02-12)|
|From:||Vladimir Makarov <email@example.com>|
|Date:||12 Feb 2000 21:31:31 -0500|
George Almasi wrote:
> Has anyone modified burg/iburg to accommodate n-ary trees?
There is analogous tool (NONA) in COCOM toolset which you can find it on
Nona implements approach of IBURG (dynamic programming during work
generator or pattern matcher) and can process n-ary trees and even DAG.
Another useful feature is guards for patterns. Actually it is possibly
to implement usage of dynamic programming during work of NONA (BURG
implements the same approach) which will results in faster generators
(pattern matchers) but the guards considerably complicates the
Return to the
Search the comp.compilers archives again.