Looking for a language to express binary decision trees

Henry Dan Lambright <hdlambri@cs.arizona.edu>
18 Jan 1996 21:23:07 -0500

          From comp.compilers

Related articles
Looking for a language to express binary decision trees hdlambri@cs.arizona.edu (Henry Dan Lambright) (1996-01-18)
| List of all articles for this month |

From: Henry Dan Lambright <hdlambri@cs.arizona.edu>
Newsgroups: comp.compilers,comp.lang.misc
Date: 18 Jan 1996 21:23:07 -0500
Organization: University of Arizona CS Department, Tucson AZ
Keywords: design, question

I am looking for advice on, or pointers to, a syntax to use in
expressing a binary decision tree in a computer language. I am
developing a small compiler which will read in this tree as input to
generate special purpose code.

Each node will have four atributes: (1) a conditional (2) percentage
of time the conditional is true (3) pointer to a node if the
conditional is true, and (4) ptr to node if the conditional is false.
The endnodes contain functions which will evaluate the final values
that the tree's target will take, along with the bitsize of that

Both the conditionals and functions are to be expressed in C. Basically
the closer the syntax looks to C, the better (because of the environment
for which this is intended.)

I am sure something like this has been developed somewhere, already.

Please send any replies to

Thanks in advance


Post a followup to this message

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